Keyword: programming: network

Found 232 papers in total
A simplex method and its implementation for network piecewise linear programming
A simplex method and its implementation for network piecewise linear programming
1997,
Network piecewise linear programming is a useful model in operations research. It...
Shortest-route formulation of mixed-model assembly line balancing problem
Shortest-route formulation of mixed-model assembly line balancing problem
1999,
A short-route formulation of the mixed-model assembly line balancing problem is...
Algorithms for the simple equal flow problem
Algorithms for the simple equal flow problem
1999,
The minimum cost flow problem is to determine a least cost shipment of a commodity...
An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
1999,
In many network routing problems several conflicting objectives must be considered....
Integer solutions of multicriteria network flow problems
Integer solutions of multicriteria network flow problems
1999,
This paper is concerned with the solution of integer multicriteria network flow...
A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
1999,
An analytical algorithm is presented to compute the network completion time...
Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm
Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm
1998,
The paper presents the methodology to obtain the optimum location of a new facility in...
Multiple bottleneck assignment problem
Multiple bottleneck assignment problem
1999,
We consider the multiple bottleneck assignment problem which subsumes the well known...
Queueing analysis of CDMA unslotted ALOHA systems with finite buffers
Queueing analysis of CDMA unslotted ALOHA systems with finite buffers
1998,
CDMA unslotted ALOHA system with finite size of queueing buffers is discussed in this...
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
Another simple proof of the validity of Nagamochi and Ibaraki's min-cut algorithm and Queyranne's extension to symmetric submodular function minimization
1998,
M. Stoer and F. Wagner and independently A. Frank have found a simple proof of the...
Algorithms for logit-based stochastic user equilibrium assignment
Algorithms for logit-based stochastic user equilibrium assignment
1998,
The paper proposes an efficient algorithm for determining the stochastic user...
Multi-commodity traffic assignment by continuum approximation of network flow with variable demand
Multi-commodity traffic assignment by continuum approximation of network flow with variable demand
1998,
Consider a city with several highly compact central business districts (CBD), and the...
Goal network programs: A specialized algorithm and an application
Goal network programs: A specialized algorithm and an application
1998,
This paper presents a specialized network procedure for the solution of pure goal...
The use of nested hulls in the symmetric traveller problem
The use of nested hulls in the symmetric traveller problem
1998,
Many heuristic algorithms for solving geometric traveller problems utilize the extreme...
A mathematical programming viewpoint for solving the ultimate pit problem
A mathematical programming viewpoint for solving the ultimate pit problem
1998,
In 1965 Helmut Lerchs and Ingo Grossmann presented to the mining community an...
An enumerative algorithm framework for a class of nonlinear integer programming problems
An enumerative algorithm framework for a class of nonlinear integer programming problems
1997,
This paper represents a framework for a branch and search algorithm for solving a...
The balanced linear programming problem
The balanced linear programming problem
1997,
The Balanced Linear Programming Problem (BLPP) arises in situations which required...
A dual ascent approach to the fixed-charge capacitated network design problem
A dual ascent approach to the fixed-charge capacitated network design problem
1996,
In this paper we consider the problem of constructing a network over which a number of...
A new pivot selection rule for the network simplex algorithm
A new pivot selection rule for the network simplex algorithm
1997,
We present a new network simplex pivot selection rule, which we call the minimum ratio...
On strongly polynomial dual simplex algorithms for the maximum flow problem
On strongly polynomial dual simplex algorithms for the maximum flow problem
1997,
Several pivot rules for the dual network simplex algorithm that enable it to solve a...
How to compute least infeasible flows
How to compute least infeasible flows
1997,
It is well-known how to use maximum flow to decide when a flow problem with demands,...
Postoptimizing equilibrium flows on large scale networks
Postoptimizing equilibrium flows on large scale networks
1996,
In a large variety of applications, equilibrium traffic flows corresponding to a set...
An implementation of linear and nonlinear multicommodity network flows
An implementation of linear and nonlinear multicommodity network flows
1996,
This work presents a new code for solving the multicommodity network flow problem with...
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
A dual ascent procedure with valid inequalities for designing hierarchical network topologies
1998,
Topological design of communication networks has been well examined in the literature....
Papers per page: