Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing

DOI10.1016/J.EJOR.2023.02.042OpenAlexW4323261900MaRDI QIDQ6113311

Laurence A. Wolsey, Dieter Weninger

Publication date: 11 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.02.042

zbMATH Keywords

integer programmingbranch-and-cutfacilities planning and designBenders' algorithmmixed integer subproblems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

New formulations for two location problems with interconnected facilities

Cites Work

• Unnamed Item
• A heuristic for BILP problems: the single source capacitated facility location problem
• Benders decomposition without separability: a computational study for capacitated facility location problems
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• On the safety of Gomory cut generators
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A cutting plane algorithm for the capacitated facility location problem
• Scatter search for the single source capacitated facility location problem
• Practical enhancements to the Magnanti-Wong method
• An exact algorithm for the capacitated facility location problems with single sourcing
• Partitioning procedures for solving mixed-variables programming problems
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Logic-based Benders decomposition
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• The Benders decomposition algorithm: a literature review
• A survey on Benders decomposition applied to fixed-charge network design problems
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Branching rules revisited
• A cut-and-solve based algorithm for the single-source capacitated facility location problem
• Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
• Benders' decomposition for the balancing of assembly lines with stochastic demand
• Refined cut selection for Benders decomposition: applied to network capacity expansion problems
• Extensions for Benders cuts and new valid inequalities for solving the European day-ahead electricity market clearing problem efficiently
• ``Facet separation with one linear program
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• A note on the selection of Benders' cuts
• A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An In-Out Approach to Disjunctive Optimization
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Multicommodity Distribution System Design by Benders Decomposition
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Integer Programming
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem

This page was built for publication: Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing