scientific article; zbMATH DE number 1330764

DOI<341::AID-NAV1>3.0.CO;2-A 10.1002/(SICI)1520-6750(199906)46:4<341::AID-NAV1>3.0.CO;2-AzbMath0957.90008MaRDI QIDQ4261216

Chris A. Wallace, Gavin J. Bell, Bruce W. Lamar

Publication date: 1 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-boundtransportation problemcapacity improvementconditional penalties

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, Algorithms for solving the single-sink fixed-charge transportation problem, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, COLE: a new heuristic approach for fixed charge problem computational results, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved branch and bound algorithm for minimum concave cost network flow problems
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• Nonconvex optimization over a polytope using generalized capacity improvement
• A branch-and-reduce approach to global optimization
• BARON: A general purpose global optimization software package
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Fixed-cost transportation problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
• Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem