An improved branch and bound algorithm for minimum concave cost network flow problems

DOI10.1007/BF01096771zbMath0781.90035OpenAlexW2914907619MaRDI QIDQ686988

Bruce W. Lamar

Publication date: 13 October 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096771

zbMATH Keywords

branch and boundminimum concave cost network flowsimple bound improvement

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items

Nonconvex optimization over a polytope using generalized capacity improvement, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, A branch-and-reduce approach to global optimization, Domain reduction techniques for global NLP and MINLP optimization, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Unnamed Item, Network cost minimization using threshold-based discounting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network flow problems with one side constraint: A comparison of three solution methods
• An algorithm for the min concave cost flow problem
• Global search algorithms for minimum concave-cost network flow problems
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Fixed-cost transportation problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Optimal Facility Location with Concave Costs
• An Algorithm for the Traveling Salesman Problem
• Minimum Concave Cost Flows in Certain Networks
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Minimum cost routing for static network models
• An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
• On the fixed cost flow problem†