Solving to optimality the uncapacitated fixed-charge network flow problem

DOI10.1016/S0305-0548(97)00035-XzbMath0907.90132OpenAlexW2023701902MaRDI QIDQ1265864

James MacGregor Smith, Frederico R. B. Cruz, Geraldo Robson Mateus

Publication date: 27 September 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00035-x

zbMATH Keywords

Lagrangean relaxationbranch-and-boundboundsuncapacitated fixed-charge network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Parallel algorithms for a multi-level network optimization problem, Minimum‐cost flow problems having arc‐activation costs, Flow constrained minimum cost flow problem, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, Minimal-cost network flow problems with variable lower bounds on arc flows, 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, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, Algorithms for a multi-level network optimization problem, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for solving to optimality uncapacitated location problems
• 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
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• Some branch-and-bound procedures for fixed-cost transportation problems
• Solving large-scale mixed-integer programs with fixed charge variables
• Tailoring Benders decomposition for uncapacitated network design
• Analysis of a flow problem with fixed charges
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems