An improved cut-and-solve algorithm for the single-source capacitated facility location problem
From MaRDI portal
Publication:1742898
DOI10.1007/s13675-017-0084-4zbMath1390.90008OpenAlexW2604493856MaRDI QIDQ1742898
Lars Relund Nielsen, Andreas Klose, Sune Lauth Gadegaard
Publication date: 12 April 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/165165328/Gadegaard_2018_An_improved_cut_and_solve_algorithm_for_the_single_source.pdf
facility locationcutting planescapacitated facility locationlocal branchingcut-and-solvesingle-sourcing
Integer programming (90C10) Mixed integer programming (90C11) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ 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 ⋮ An effective hybrid approach to the two-stage capacitated facility location problem ⋮ The complete vertex \(p\)-center problem ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ SSCFLPsolver ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A branch-and-price algorithm for the capacitated facility 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
- On the \(0/1\) knapsack polytope
- Local branching
- A repeated matching heuristic for the single-source capacitated facility location problem
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- 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
- Discretized formulations for capacitated location problems with modular distribution costs
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- Facets of the Knapsack Polytope From Minimal Covers
- Generating Fenchel Cutting Planes for Knapsack Polyhedra
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Reducibility among Combinatorial Problems
