Exact solution of multicommodity network optimization problems with general step cost functions
From MaRDI portal
Publication:1306346
DOI10.1016/S0167-6377(99)00020-6zbMath0967.90012MaRDI QIDQ1306346
Michel Minoux, Virginie Gabrel, Arnaud Knippel
Publication date: 3 September 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
The multidimensional 0-1 knapsack problem -- bounds and computational aspects, 0-1 reformulations of the multicommodity capacitated network design problem, An improved Benders decomposition applied to a multi-layer network design problem, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, The multidimensional 0-1 knapsack problem: an overview., A survey on Benders decomposition applied to fixed-charge network design problems, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, The multi-layered network design problem, Solving a capacitated hub location problem, Optimal solution of the discrete cost multicommodity network design problem, Accelerating Benders method using covering cut bundle generation, Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Ancestor tree for arbitrary multi-terminal cut functions
- A polyhedral approach to multicommodity survivable network design
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- An Application of Generalized Linear Programming to Network Flows
- Tailoring Benders decomposition for uncapacitated network design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On the Extreme Rays of the Metric Cone
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Survey of Linear Cost Multicommodity Network Flows
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Shortest paths, single origin‐destination network design, and associated polyhedra