Keyword: programming: network

Found 232 papers in total
Some fixed-point results for the dynamic assignment problem
Some fixed-point results for the dynamic assignment problem
2003,
In previous work the authors consider the dynamic assignment problem, which involves...
A sequential approximation method using neural networks for engineering design optimization problems
A sequential approximation method using neural networks for engineering design optimization problems
2003,
There are three characteristics in engineering design optimization problems: (1) the...
Multicommodity network expansion under elastic demands
Multicommodity network expansion under elastic demands
2001,
We analyze some issues of network design and bandwidth allocation in telecommunication...
New maximum flow algorithms by maximum adjacency orderings and scaling
New maximum flow algorithms by maximum adjacency orderings and scaling
2003,
Maximum adjacency (MA) ordering has effectively been applied to graph connectivity...
The mixed general routing polyhedron
The mixed general routing polyhedron
2003,
In Arc Routing Problem, ARPs, the aim is to find on a graph a minimum cost traversal...
Faster algorithms for the generalized network flow problem
Faster algorithms for the generalized network flow problem
1998,
We consider the generalized network flow problem. Each arc e in the network has a gain...
Neuro-fuzzy and genetic algorithm in multiple response optimization
Neuro-fuzzy and genetic algorithm in multiple response optimization
2002,
Optimization of a multiple output system, whose function is only approximately known...
The reversal median problem
The reversal median problem
2003,
In this paper, we study the Reversal Median Problem (RMP), which arises in...
Solving generalized transportation problems via pure transportation problems
Solving generalized transportation problems via pure transportation problems
2002,
This paper investigates certain issues of coefficient sensitivity in generalized...
Chained Lin–Kernighan for large traveling salesman problems
Chained Lin–Kernighan for large traveling salesman problems
2003,
We discuss several issues that arise in the implementation of Martin, Otto, and...
A linear programming approach to discriminant analysis with a reserved-judgment region
A linear programming approach to discriminant analysis with a reserved-judgment region
2003,
A linear-programming model is proposed for deriving discriminant rules that allow...
A capacity restraint transit assignment with elastic line frequency
A capacity restraint transit assignment with elastic line frequency
2002,
This paper proposes a new formulation for the capacity restraint transit assignment...
Optimal sizing of irrigation delivery systems using a two-stage stochastic programming approach
Optimal sizing of irrigation delivery systems using a two-stage stochastic programming approach
2001,
In arid areas where the available water is limited and randomly changing with time,...
The quickest path problem with batch constraints
The quickest path problem with batch constraints
2003,
The quickest path problem has been proposed to cope with flow problems through...
Sorting permutations by reversals through branch-and-price
Sorting permutations by reversals through branch-and-price
2001,
We describe an exact algorithm for the problem of sorting a permutation by the minimum...
A stochastic integer program with dual network structure and its application to the ground-holding problem
A stochastic integer program with dual network structure and its application to the ground-holding problem
2003,
In this paper, we analyze a generalization of a classic network-flow model. The...
A reduction technique for natural gas transmission network optimization problems
A reduction technique for natural gas transmission network optimization problems
2002,
We address the problem of minimizing the fuel consumption incurred by compressor...
Minimax models for diverse routing
Minimax models for diverse routing
2002,
An important task in the management and administration of communication networks is...
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
2002,
The transportation problem with exclusionary side constraints, a practical...
A comparative analysis of several formulations for the generalized minimum spanning tree problem
A comparative analysis of several formulations for the generalized minimum spanning tree problem
2002,
This article describes eight formulations for the Generalized Minimum Spanning Tree...
A linear-size zero–one programming model for the minimum spanning tree problem in planar graphs
A linear-size zero–one programming model for the minimum spanning tree problem in planar graphs
2002,
A new linear zero–one programming model is presented for the problem of finding...
The simplex algorithm for multicommodity networks
The simplex algorithm for multicommodity networks
2002,
We consider multicommodity network flow problems, where external flow is allowed to...
A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost
A heuristic search approach for a nonstationary stochastic shortest path problem with terminal cost
2002,
We present a best-first heuristic search approach for determining an optimal policy...
An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem
An adaptive dynamic programming algorithm for the heterogeneous resource allocation problem
2002,
We consider an aggregated version of a large-scale driver scheduling problem, derived...
Papers per page: