Keyword: programming: network

Found 232 papers in total
The auction algorithm for assignment and other network flow problems: A tutorial
The auction algorithm for assignment and other network flow problems: A tutorial
1990,
The auction algorithm is an intuitive method for solving the classical assignment...
A relaxation/decomposition algorithm for the fixed charged network problem
A relaxation/decomposition algorithm for the fixed charged network problem
1990,
This article makes use of relaxation in conjunction with decomposition for the...
Approximation of convex curves with application to the Bicriterial Minimum Cost Flow Problem
Approximation of convex curves with application to the Bicriterial Minimum Cost Flow Problem
1989,
An approximation of an explicitly or implicitly given convex curve in the plane is...
Polynomial time interior point algorithms for transportation problems
Polynomial time interior point algorithms for transportation problems
1989,
This paper deals with the Hitchcock transportation problem with m supply points and n...
IC insertion: An application of the travelling salesman problem
IC insertion: An application of the travelling salesman problem
1989,
Chip insertion problems arise naturally in electronic board assembly. Several examples...
Maintaining project networks in automated artificial intelligence planning
Maintaining project networks in automated artificial intelligence planning
1989,
AI automated plan synthesis programs (‘planners’) typically represent...
Methods for designing communications networks with certain two-connected survivability constraints
Methods for designing communications networks with certain two-connected survivability constraints
1989,
In this paper, the authors consider the problem of designing a minimum cost...
The adult training centre problem: A case study
The adult training centre problem: A case study
1989,
An optimal solution is found to a real-world problem which has the characteristics of...
An algorithm for finding a forest in a planar graph-Case in which all terminals of each net lie on one of two specified face boundaries
An algorithm for finding a forest in a planar graph-Case in which all terminals of each net lie on one of two specified face boundaries
1988,
Several routing problems such as VLSI river routing and one-layer routing can be...
Large scale network analysis with applications to transportation, communication and inference networks
Large scale network analysis with applications to transportation, communication and inference networks
1988,
The study of large scale networks has been mainly motivated by practical problems....
On fractional multicommodity flows and distance functions
On fractional multicommodity flows and distance functions
1988,
The authors give some results on the existence of fractional and integral solutions to...
Design and implementation of an interactive optimization system for network design in the motor carrier industry
Design and implementation of an interactive optimization system for network design in the motor carrier industry
1989,
The authors describe the design and implementation of an interactive optimization...
Coordinating product distribution and empty equipment allocation decisions in large networks
Coordinating product distribution and empty equipment allocation decisions in large networks
1989,
General Motors uses large equipment fleets (railcars and trucks) for shipping vehicles...
Project crashing with variations in reward and penalty functions: Some mathematical programming formulations
Project crashing with variations in reward and penalty functions: Some mathematical programming formulations
1988,
In this paper some mathematical programming formulations for project crashing in the...
A computational comparison of the Dinic and network simplex methods for maximum flow
A computational comparison of the Dinic and network simplex methods for maximum flow
1988,
The authors study the implementation of two fundamentally different algorithms for...
The relax codes for linear minimum cost network flow problems
The relax codes for linear minimum cost network flow problems
1988,
The authors describe a relaxation algorithm for solving the classical minimum cost...
Papers per page: