Keyword: programming: network

Found 232 papers in total
A faster algorithm for the ring loading problem with demand splitting
A faster algorithm for the ring loading problem with demand splitting
2001,
In the ring loading problem with demand splitting, traffic demands are given for each...
A variable neighborhood descent algorithm for the undirected capacitated arc routing problem
A variable neighborhood descent algorithm for the undirected capacitated arc routing problem
2001,
The undirected capacitated are routing problem (CARP) arises naturally in several...
The structure and complexity of sports elimination numbers
The structure and complexity of sports elimination numbers
2002,
Identifying the teams that are already eliminated from contention for first place of a...
A comparison of optimal methods for local access uncapacitated network design
A comparison of optimal methods for local access uncapacitated network design
2001,
We compare some optimal methods addressed to a problem of local access network design....
Cellular network design site selection and frequency planning
Cellular network design site selection and frequency planning
2001,
Deployment of cellular networks involves substantial capital investment. Competition...
Optimal network design for wireless local area network
Optimal network design for wireless local area network
2001,
Network design for wireless local area networks is an important issue in the...
Channel assignment with large demands
Channel assignment with large demands
2001,
We introduce a general static model for radio channel assignment, the ‘feasible...
Modeling and solving an airline schedule generation problem
Modeling and solving an airline schedule generation problem
2001,
Since opening a new flight connection or closing an existing flight has a great impact...
Optimum requirement Hamilton cycle problem with a Monge-like property
Optimum requirement Hamilton cycle problem with a Monge-like property
2002,
Given a simple graph G with a vertex set V and a set of ‘requirements’ { r...
An augmented arborescence formulation for the two-level network design problem
An augmented arborescence formulation for the two-level network design problem
2001,
In this paper we discuss formulations for the Two Level Network Design (TLND) problem....
Multiparametric demand transportation problem
Multiparametric demand transportation problem
2002,
In some applications a minimum cost transportation model arises where supplies are...
Development of evolutionary algorithms for determining the k most vital arcs in shortest path problem
Development of evolutionary algorithms for determining the k most vital arcs in shortest path problem
2001,
The purpose of this study is to present methods for determining the k most vital arcs...
An algorithmic study of the maximum flow problem: A comparative statistical analysis
An algorithmic study of the maximum flow problem: A comparative statistical analysis
2000,
In this paper, we show the results of an experimental study about the most important...
Primal–dual methods for sustainable harvest scheduling problems
Primal–dual methods for sustainable harvest scheduling problems
2001,
Timber harvest schedules form the heart of forest resource management. The operations...
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
2000,
This paper introduces a network design problem with a structure that is encountered in...
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 parallel computation approach for solving multistage stochastic network problems
A parallel computation approach for solving multistage stochastic network problems
1999,
This paper presents a parallel computation approach for the efficient solution of very...
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 comprehensive simplex-like algorithm for network optimization and perturbation analysis
A comprehensive simplex-like algorithm for network optimization and perturbation analysis
1995,
The family of network optimization problems includes the following prototype models:...
The dynamic predicate stashing copy problem and the Steiner problem in graphs
The dynamic predicate stashing copy problem and the Steiner problem in graphs
2000,
The Dynamic Predicate Stashing Copy Problem (DPSCP) is a problem about managing an...
On network simplex method using the primal–dual symmetric pivoting rule
On network simplex method using the primal–dual symmetric pivoting rule
2000,
We consider a network simplex method using the primal–dual symmetric pivoting...
A directed hypergraph model for random time dependent shortest paths
A directed hypergraph model for random time dependent shortest paths
2000,
We consider routing problems in dynamic networks where arc travel times are both...
A further study on inverse linear programming problems
A further study on inverse linear programming problems
1999,
In this paper we continue our previous study on inverse linear programming problems...
Weight of shortest path analyses for the optimal location problem
Weight of shortest path analyses for the optimal location problem
2000,
In this paper we consider the shortest path counting problem ( SPCP ): how many...
Papers per page: