Keyword: programming: network

Found 232 papers in total
A new subtour elimination constraint for the vehicle routing problem
A new subtour elimination constraint for the vehicle routing problem
1996,
Vehicle Routing Problems (VRP) are concerned with the delivery of a single commodity...
Daily aircraft routing and scheduling
Daily aircraft routing and scheduling
1997,
In this paper we consider the daily aircraft routing and scheduling problem (DARSP)....
A new CPM time–cost trade-offs algorithm
A new CPM time–cost trade-offs algorithm
1993,
In this paper we give a fast, new algorithm for the Critical Path Method...
An algorithm to solve the time–cost trade-offs problem in precedence diagramming
An algorithm to solve the time–cost trade-offs problem in precedence diagramming
1993,
In this paper we give a fast, new algorithm for the Time–Cost Trade-Offs problem...
Calculating some inverse linear programming problems
Calculating some inverse linear programming problems
1996,
In this paper we consider some inverse LP problems in which we need to adjust the cost...
Ratio combinatorial programs
Ratio combinatorial programs
1995,
We consider here a combinatorial optimization problem where the objective function is...
Simple local search problems that are hard to solve
Simple local search problems that are hard to solve
1991,
Many algorithms for NP-hard optimization problems find solutions that are locally...
Calibration of objective functions in stochastic linear models of production networks
Calibration of objective functions in stochastic linear models of production networks
1996,
In our study we concentrated on the random aspects of a network production problem in...
Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem
Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem
1996,
Practicable methods for optimising concave-cost, uncapacitated transshipment networks...
An approach based on necessity measure to the fuzzy spanning tree problems
An approach based on necessity measure to the fuzzy spanning tree problems
1996,
On the decision problems with defective information, the uncertain elements are often...
Is a given flow uncontrollable?
Is a given flow uncontrollable?
1996,
An s-t flow in a directed network is called ‘uncontrollable’, when the...
Computational experience with a difficult mixed-integer multicommodity flow problem
Computational experience with a difficult mixed-integer multicommodity flow problem
1995,
The following problem arises in the study of lightwave networks. Given a demand matrix...
A linear time algorithm for maximum matchings in convex, bipartite graphs
A linear time algorithm for maximum matchings in convex, bipartite graphs
1996,
The problem of determining the maximum matching in a convex bipartite graph, G=(V 1 ,V...
Designing distribution systems with transport economies of scale
Designing distribution systems with transport economies of scale
1993,
This paper is concerned with some aspects of distribution planning which are rarely...
An algorithm for the ranking of shortest paths
An algorithm for the ranking of shortest paths
1993,
An efficient computational implementation of a path deletion K shortest paths...
A shortest path problem on the network with AGV-type time-windows
A shortest path problem on the network with AGV-type time-windows
1996,
This paper deals with a shortest path problem on a network with time-windows. The...
The vehicle routing problem with time constraints
The vehicle routing problem with time constraints
1995,
This paper deals with a vehicle routing problem of finding the minimum number of...
Primal-dual proximal point algoritm for multicommodity network flow problems
Primal-dual proximal point algoritm for multicommodity network flow problems
1994,
In this paper, the authors consider how to apply a primal-dual proximal point...
Optimal bin location and sequencing in printed circuit board assembly
Optimal bin location and sequencing in printed circuit board assembly
1993,
A particular problem concerning the efficient production of printed circuit boards in...
Dispersing facilities on a network
Dispersing facilities on a network
1994,
The p-maxisum dispersion problem consists of locationg p facilities at vertices of a...
Ripples, complements, and substitutes in generalized networks
Ripples, complements, and substitutes in generalized networks
1996,
The authors extend the qualitative theory of sensitivity analysis for minimum-cost...
Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future
1996,
Many sequential planning problems can be represented as a shortest path problem in an...
Dynamic factorization in large-scale optimization
Dynamic factorization in large-scale optimization
1994,
Factorization of linear programming (LP) models enables a large portion of the LP...
Lower spacial representation of zoomed structural modeling by nonmetric MDS
Lower spacial representation of zoomed structural modeling by nonmetric MDS
1994,
A method is proposed for making lower spacial representations of system structures by...
Papers per page: