Keyword: graphs

Found 1175 papers in total
On the disjoint paths problem
On the disjoint paths problem
2007,
Using flow and matching algorithms to solve the problem of finding disjoint paths...
Data mining in an engineering design environment: OR applications from graph matching
Data mining in an engineering design environment: OR applications from graph matching
2006,
Data mining has been making inroads into the engineering design environment – an...
Mining market data: A network approach
Mining market data: A network approach
2006,
We consider a network representation of the stock market data referred to as the...
Combining constraint propagation and meta-heuristics for searching a Maximum Weight Hamiltonian chain
Combining constraint propagation and meta-heuristics for searching a Maximum Weight Hamiltonian chain
2006,
This paper presents the approach that we developed to solve the ROADEF 2003 challenge...
Variable neighborhood search for the linear ordering problem
Variable neighborhood search for the linear ordering problem
2006,
Given a matrix of weights, the linear ordering problem (LOP) consists of finding a...
A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
2006,
An efficient and effective tabu search implementation for the weighted maximal planar...
A survey of local search methods for graph coloring
A survey of local search methods for graph coloring
2006,
Tabucol is a tabu search algorithm that tries to determine whether the vertices of a...
A unified framework for partial and hybrid search methods in constraint programming
A unified framework for partial and hybrid search methods in constraint programming
2006,
We present a library called ToOLS for the design of complex tree search algorithms in...
A constraint programming approach to cutset problems
A constraint programming approach to cutset problems
2006,
We consider the problem of finding a cutset in a directed graph G=(V,E) , i.e., a set...
The bottleneck problem with minimum quantity commitments
The bottleneck problem with minimum quantity commitments
2006,
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem...
Stronger linear programming relaxations of max-cut
Stronger linear programming relaxations of max-cut
2003,
We consider linear programming relaxations for the max cut problem in graphs, based on...
Evaluating order of circuits for deadlock avoidance in a flexible manufacturing system
Evaluating order of circuits for deadlock avoidance in a flexible manufacturing system
2006,
In modern highly automated flexible manufacturing systems, various parts are processed...
A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
2005,
A phylogeny is a tree that relates taxonomic units, based on their similarity over a...
The Freeze-Tag Problem: How to wake up a swarm of robots
The Freeze-Tag Problem: How to wake up a swarm of robots
2006,
An optimization problem that naturally arises in the study of swarm robotics is the...
Deterministic rendezvous in graphs
Deterministic rendezvous in graphs
2006,
Two mobile agents having distinct identifiers and located in nodes of an unknown...
Generation of possible multiple components disassembly sequence for maintenance using a disassembly constraint graph
Generation of possible multiple components disassembly sequence for maintenance using a disassembly constraint graph
2006,
Relatively few systems are designed to operate without maintenance of any kind. For...
A graph theoretic approach for supply chain coordination
A graph theoretic approach for supply chain coordination
2006,
Supply chain coordination is an effective approach to manage the dependencies among...
Minimum multiple message broadcast graphs
Minimum multiple message broadcast graphs
2006,
Multiple message broadcasting is the process of multiple message dissemination in a...
Strengthened 0–1 linear formulation for the daily satellite mission planning
Strengthened 0–1 linear formulation for the daily satellite mission planning
2006,
In this paper, we compare several 0–1 linear programs for solving the satellite...
Fixed tree games with multilocated players
Fixed tree games with multilocated players
2006,
This article introduces fixed tree games with multilocated players (FMP games), which...
Heuristic search for the generalized minimum spanning tree problem
Heuristic search for the generalized minimum spanning tree problem
2005,
The generalized minimum spanning tree (GMST) problem occurs in telecommunications...
A ‘maximum node clustering’ problem
A ‘maximum node clustering’ problem
2006,
In this note we introduce a graph problem, called Maximum Node Clustering (MNC). We...
Upgrading arcs to minimize the maximum travel time in a network
Upgrading arcs to minimize the maximum travel time in a network
2006,
In transportation and telecommunication systems, the performance of the underlying...
On a paradox of traffic planning
On a paradox of traffic planning
2005,
For each point of a road network, let there be given the number of cars starting from...
Papers per page: