Keyword: graphs

Found 1175 papers in total
Balanced graphs and network flows
Balanced graphs and network flows
1997,
A graph G is balanced if the maximum ratio of edges to vertices, taken over all...
A polyhedral graph theory approach to revenue management in the airline industry
A polyhedral graph theory approach to revenue management in the airline industry
2000,
Revenue management is a business principle that balances supply and demand to control...
The model and algorithm of using shunting engines for railroad technical service station
The model and algorithm of using shunting engines for railroad technical service station
2000,
The key problem of how to make the plan of using yard engines in the process of making...
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph
A simple O(n2) algorithm for the all-pairs shortest path problem on an interval graph
1996,
Let G denote an interval graph with n vertices and unit weight edges. In this paper,...
A single facility location problem on a tree with unreliable edges
A single facility location problem on a tree with unreliable edges
1996,
This paper addresses the problem of determining a single facility location on an...
Practical efficiency of the linear-time algorithm for the single source shortest path problem
Practical efficiency of the linear-time algorithm for the single source shortest path problem
2000,
Thorup's linear-time algorithm for the Single Source Shortest Path problem consists of...
A note on the generalized Steiner tree polytope
A note on the generalized Steiner tree polytope
2000,
The generalized Steiner tree problem (GSTP) is a variant of the classical Steiner tree...
Set packing relaxations of some integer programs
Set packing relaxations of some integer programs
2000,
This paper is about set packing relaxations of combinatorial optimization problems...
Dynamic storage allocation with known durations
Dynamic storage allocation with known durations
2000,
This paper is concerned with a new version of on-line storage allocation in which the...
On the P4-components of graphs
On the P4-components of graphs
2000,
Two edges are called P 4 -adjacent if they belong to the same P 4 (chordless path on...
On the computational complexity of edge concentration
On the computational complexity of edge concentration
2000,
Suppose that G =( U,L,E ) is a bipartite graph with vertex set U ∪ L and edge set...
Tree partitioning under constraints – clustering for vehicle routing problems
Tree partitioning under constraints – clustering for vehicle routing problems
2000,
We present a dynamic programming algorithm for the following problem: Given a tree T =...
A generalized optimum requirement spanning tree problem with a Monge-like property
A generalized optimum requirement spanning tree problem with a Monge-like property
2000,
We consider a generalized optimum requirement spanning tree problem (GORST problem)...
Another proof of polynomial-time recognizability of Delaunay graphs
Another proof of polynomial-time recognizability of Delaunay graphs
2000,
This paper presents an algorithm to judge whether a given graph is homeomorphic to...
Maximally weighted graph theoretic facilities design planning
Maximally weighted graph theoretic facilities design planning
2000,
This paper examines how graph theory can be used to create facility designs. It...
The exact overall time distribution of a project with uncertain task durations
The exact overall time distribution of a project with uncertain task durations
2000,
This paper presents a new technique for computing the exact overall duration of a...
The disjunctive graph machine representation of the job shop scheduling problem
The disjunctive graph machine representation of the job shop scheduling problem
2000,
The disjunctive graph is one of the most popular models used for describing instances...
The 3D-packing by Meta Data Structure and packing heuristics
The 3D-packing by Meta Data Structure and packing heuristics
2000,
The three dimensional (3D) packing problem is to arrange given rectangular boxes in a...
Even-aged restrictions with sub-graph adjacency
Even-aged restrictions with sub-graph adjacency
2000,
Restrictions on the size and proximity of clearcuts have led to the development of a...
Solving a chemical batch scheduling problem by local search
Solving a chemical batch scheduling problem by local search
2000,
In this paper the following chemical batch scheduling problem is considered: a set of...
A polyhedral graph theory approach to revenued management in the airline industry
A polyhedral graph theory approach to revenued management in the airline industry
2000,
Revenue management is a business principle that balances supply and demand to control...
Shortest path in the presence of obstacles: An application to ocean shipping
Shortest path in the presence of obstacles: An application to ocean shipping
2000,
This paper presents the problem of determining the estimated time of arrival at the...
Modified Hamiltonian chain: A graph theoretic approach to group technology
Modified Hamiltonian chain: A graph theoretic approach to group technology
2000,
Graph theory can be effectively applied to the group technology configuration problem....
Integrating assembly and machining planning using graph-based representation models
Integrating assembly and machining planning using graph-based representation models
2000,
Traditionally, assembly planning and machining planning are considered as two...
Papers per page: