Keyword: graphs

Found 1175 papers in total
Access path optimization in relational joins
Access path optimization in relational joins
1995,
The objective of access path optimization in relational joins is to minimize the...
Guided local search with shifting bottleneck for job shop scheduling
Guided local search with shifting bottleneck for job shop scheduling
1998,
Many recently developed local search procedures for job shop scheduling use...
Schedule optimization at SNCF: From conception to day of departure
Schedule optimization at SNCF: From conception to day of departure
1998,
Because of the upcoming deregulation and the advent of high-speed rail networks,...
A colourful look on evolutionary techniques
A colourful look on evolutionary techniques
1995,
Evolutionary techniques are solution methods inspired from natural evolution. They...
Metagraphs in hierarchical modeling
Metagraphs in hierarchical modeling
1997,
When using a decision support system (DSS) containing a large model base, a user has...
A 2n constraint formulation for the capacitated minimal spanning tree problem
A 2n constraint formulation for the capacitated minimal spanning tree problem
1995,
In this paper we present a new formulation for the Capacitated Minimal Spanning Tree...
The generalized stable set problem for perfect bidirected graphs
The generalized stable set problem for perfect bidirected graphs
1997,
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we...
A bound for the Symmetric Travelling Salesman Problem through matroid formulation
A bound for the Symmetric Travelling Salesman Problem through matroid formulation
1995,
A new bound for the Symmetric Travelling Salesman Problem is proposed, using a matroid...
On mobile robots flow in locally uniform networks
On mobile robots flow in locally uniform networks
1997,
In a mobile robot flow network different levels of flow intensity exist between the...
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
1995,
This article analyses the problem of scheduling non-preemptive jobs processed within...
Connections between semidefinite relaxations of the max-cut and stable set problems
Connections between semidefinite relaxations of the max-cut and stable set problems
1997,
We describe links between a recently introduced semidefinite relaxation for the...
Minimization of open orders – polynomial algorithms for some special cases
Minimization of open orders – polynomial algorithms for some special cases
1996,
Consider a production system where a batch of tasks have to be performed. Once a task...
The hybrid spanning tree problem
The hybrid spanning tree problem
1994,
The minimal spanning tree problem is a well-known problem in operations research. In...
Formulations and valid inequalities for the node capacitated graph partitioning problem
Formulations and valid inequalities for the node capacitated graph partitioning problem
1996,
We investigate the problem of partitioning the nodes of a graph under capacity...
Binary integer programs with two variables per inequality
Binary integer programs with two variables per inequality
1996,
Several recent papers have shown that some properties of the maximum weight stable set...
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
1997,
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
The k-neighbor, r-domination problems on interval graphs
The k-neighbor, r-domination problems on interval graphs
1994,
Many facility location problems are modeled as optimization problems on graphs. We...
A linear-time algorithm for determining the order of moving products in reallocation problems
A linear-time algorithm for determining the order of moving products in reallocation problems
1997,
The reallocation problem is defined as determining whether products can be moved from...
Ants can colour graphs
Ants can colour graphs
1997,
In the last few years researchers have shown how insect colonies can be seen as a...
Shortest path problem with an obstructor
Shortest path problem with an obstructor
1996,
Let G=(V,A) be a directed graph with (positive) length l(a) for each a∈A, and two...
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
1997,
The satellite shot sequencing problem consists in choosing the pictures to be...
A branch and cut algorithm for a Steiner tree-star problem
A branch and cut algorithm for a Steiner tree-star problem
1996,
This paper deals with a Steiner tree-star problem that is a special case of the degree...
Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
1994,
Necessary and sufficient conditions are provided for optimality of a matching in a...
Rooted routing in the plane
Rooted routing in the plane
1995,
This paper, which was published without an abstract, is concerned with the following...
Papers per page: