Exact solution of multicommodity network optimization problems with general step cost functions

DOI10.1016/S0167-6377(99)00020-6zbMATH Open0967.90012WikidataQ127227033 ScholiaQ127227033MaRDI QIDQ1306346FDOQ1306346

Authors: V. Gabrel, Arnaud Knippel, Michel Minoux 

Publication date: 3 September 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Recommendations

• Discrete cost multicommodity network optimization problems and exact solution methods
• An exact approach for the multicommodity network optimization problem with a step cost function
• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• Optimal solution of the discrete cost multicommodity network design problem

zbMATH Keywords

multicommodity flowsBenders methodmultiple constraint generationoptimum network design

Mathematics Subject Classification ID

Decomposition methods (49M27) Stochastic network models in operations research (90B15)

Cites Work

• Network flows. Theory, algorithms, and applications.
• An Efficient Heuristic Procedure for Partitioning Graphs
• Partitioning procedures for solving mixed-variables programming problems
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• A Survey of Linear Cost Multicommodity Network Flows
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Title not available (Why is that?)
• An Application of Generalized Linear Programming to Network Flows
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
• Network Design Using Cut Inequalities
• Ancestor tree for arbitrary multi-terminal cut functions
• Tailoring Benders decomposition for uncapacitated network design
• Title not available (Why is that?)
• A polyhedral approach to multicommodity survivable network design
• On the Extreme Rays of the Metric Cone
• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• Shortest paths, single origin‐destination network design, and associated polyhedra

Cited In (30)

• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
• Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
• Benders decomposition approach for the robust network design problem with flow bifurcations
• The Benders decomposition algorithm: a literature review
• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• Adaptive memory in multistart heuristics for multicommodity network design
• Optimal solution of the discrete cost multicommodity network design problem
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• Step graphs and their application to the organization of commodity flows in networks
• Discrete cost multicommodity network optimization problems and exact solution methods
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• An improved Benders decomposition applied to a multi-layer network design problem
• The multi-layered network design problem
• The multidimensional 0-1 knapsack problem: an overview.
• 0-1 reformulations of the multicommodity capacitated network design problem
• Accelerating Benders method using covering cut bundle generation
• A survey on Benders decomposition applied to fixed-charge network design problems
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• 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
• Solving a capacitated hub location problem
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
• Engineering Negative Cycle Canceling for Wind Farm Cabling
• Exact approaches to the single-source network loading problem
• Multicommodity network flows: a survey. I: Applications and formulations

This page was built for publication: Exact solution of multicommodity network optimization problems with general step cost functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306346)