Solving to optimality the uncapacitated fixed-charge network flow problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 556046
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- scientific article; zbMATH DE number 4147878
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
Cites work
- A branch-and-bound algorithm to solve a multi-level network optimization problem
- A method for solving to optimality uncapacitated location problems
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Analysis of a flow problem with fixed charges
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1253063 (Why is no real title available?)
- Solving large-scale mixed-integer programs with fixed charge variables
- Some branch-and-bound procedures for fixed-cost transportation problems
- Tailoring Benders decomposition for uncapacitated network design
- The telephonic switching centre network problem: Formalization and computational experience
- Topological design of telecommunication networks --- local access design methods
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
Cited in
(22)- A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem
- Valid inequalities and separation for uncapacitated fixed charge networks
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Algorithms for a multi-level network optimization problem
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Flow constrained minimum cost flow problem
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- New exact techniques applied to a class of network flow formulations
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Towards optimizing the deployment of optical access networks
- Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- scientific article; zbMATH DE number 4147878 (Why is no real title available?)
- scientific article; zbMATH DE number 1063799 (Why is no real title available?)
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Parallel algorithms for a multi-level network optimization problem
- Minimum‐cost flow problems having arc‐activation costs
- Minimal-cost network flow problems with variable lower bounds on arc flows
- Uncapacitated flow-based extended formulations
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Bilinear modeling solution approach for fixed charge network flow problems
This page was built for publication: Solving to optimality the uncapacitated fixed-charge network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265864)
