A cut-and-solve based algorithm for the single-source capacitated facility location problem
From MaRDI portal
Publication:1926885
DOI10.1016/j.ejor.2012.03.047zbMath1253.90143OpenAlexW2067093916MaRDI QIDQ1926885
Haoxun Chen, Feng Chu, Zhen Yang
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.047
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (13)
A heuristic for BILP problems: the single source capacitated facility location problem ⋮ An integrated approach for a new flexible multi-product disassembly line balancing problem ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ The capacitated mobile facility location problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ A new extended formulation with valid inequalities for the capacitated concentrator location problem ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
Uses Software
Cites Work
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Scatter search for the single source capacitated facility location problem
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- The complexity of cover inequality separation
- On the \(0/1\) knapsack polytope
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Upper and lower bounds for the single source capacitated location problem.
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- Lagrangean heuristics for location problems
- Sequence independent lifting in mixed integer programming
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Separation algorithms for 0-1 knapsack polytopes
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- Fenchel Cutting Planes for Integer Programs
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Solving capacitated facility location problems by Fenchel cutting planes
- Solving Multiple Knapsack Problems by Cutting Planes
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
This page was built for publication: A cut-and-solve based algorithm for the single-source capacitated facility location problem
