Exact solution of multicommodity network optimization problems with general step cost functions
From MaRDI portal
Publication:1306346
DOI10.1016/S0167-6377(99)00020-6zbMath0967.90012WikidataQ127227033 ScholiaQ127227033MaRDI 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 impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Exact approaches to the single-source network loading problem, The multi-layered network design problem, Solving a capacitated hub location problem, Benders decomposition approach for the robust network design problem with flow bifurcations, Benders, metric and cutset inequalities for multicommodity capacitated network design, Speed-up Benders decomposition using maximum density cut (MDC) generation, An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions, Unnamed Item, The multidimensional 0-1 knapsack problem: an overview., Accelerating Benders method using covering cut bundle generation, The Benders decomposition algorithm: a literature review, Adaptive memory in multistart heuristics for multicommodity network design, A survey on Benders decomposition applied to fixed-charge network design problems, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Optimal solution of the discrete cost multicommodity network design problem, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Engineering Negative Cycle Canceling for Wind Farm Cabling, Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation, 0-1 reformulations of the multicommodity capacitated network design problem, An improved Benders decomposition applied to a multi-layer network design problem, Directed fixed charge multicommodity network design: a cutting plane approach using polar duality, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, An exact approach for the multicommodity network optimization problem with a step cost function, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
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
