Exact solution of multicommodity network optimization problems with general step cost functions
From MaRDI portal
(Redirected from Publication:1306346)
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
Cites work
- scientific article; zbMATH DE number 3843497 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- A Survey of Linear Cost Multicommodity Network Flows
- A polyhedral approach to multicommodity survivable network design
- An Application of Generalized Linear Programming to Network Flows
- An Efficient Heuristic Procedure for Partitioning Graphs
- Ancestor tree for arbitrary multi-terminal cut functions
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Network flows. Theory, algorithms, and applications.
- 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
- Partitioning procedures for solving mixed-variables programming problems
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Tailoring Benders decomposition for uncapacitated network design
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
Cited in
(30)- Exact approaches to the single-source network loading problem
- Multicommodity network flows: a survey. I: Applications and formulations
- 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
- The Benders decomposition algorithm: a literature review
- Benders decomposition approach for the robust network design problem with flow bifurcations
- 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
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Optimal solution of the discrete cost multicommodity network design problem
- 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 multidimensional 0-1 knapsack problem: an overview.
- The multi-layered network design problem
- 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
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- An exact approach for the multicommodity network optimization problem with a step cost function
- 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
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)
