An exact method for the two-echelon, single-source, capacitated facility location problem

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B80: Discrete location and assignment

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
A heuristic lagrangean algorithm for the capacitated plant location problem
A comparison of heuristics and relaxations for the capacitated plant location problem
A method for solving to optimality uncapacitated location problems
Facility location models for distribution planning
Efficient algorithms for the capacitated concentrator location problem
An algorithm for solving large capacitated warehouse location problems
An exact algorithm for the capacitated facility location problems with single sourcing
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
A repeated matching heuristic for the single-source capacitated facility location problem
Lagrangean heuristics for location problems
A Lagrangian heuristic for the capacitated plant location problem with single source constraints
A Multiplier Adjustment Method for the Generalized Assignment Problem
An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
An Overview of Representative Problems in Location Research
An Algorithm for Large Zero-One Knapsack Problems
The Lagrangian Relaxation Method for Solving Integer Programming Problems
A branch and bound algorithm for the generalized assignment problem
A Plant and Warehouse Location Problem
An Improved Algorithm for the Capacitated Facility Location Problem
A Survey of Lagrangean Techniques for Discrete Optimization