Analysis of a flow problem with fixed charges

DOI10.1002/net.3230190304zbMath0673.90035MaRDI QIDQ3827774

Dorit S. Hochbaum, Arie Segev

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190304

zbMATH Keywords

Lagrange multipliers; heuristics; bounds; NP-hard; network design; routing; minimum cost collection

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

Related Items

Tree network design avoiding congestion, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints, An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, Optimal design of a distributed network with a two-level hierarchical structure, Solving to optimality the uncapacitated fixed-charge network flow problem, Algorithms for a multi-level network optimization problem, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, Cross-facility management of production and transportation planning problem, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Memetic algorithms, On budget-constrained flow improvement.

Cites Work

• Tailoring Benders decomposition for uncapacitated network design
• Large-Scale Network Topological Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item