Benders decomposition without separability: a computational study for capacitated facility location problems
From MaRDI portal
Publication:323204
DOI10.1016/J.EJOR.2016.03.002zbMATH Open1346.90490OpenAlexW2301790113MaRDI QIDQ323204FDOQ323204
Authors: Matteo Fischetti, Ivana Ljubić, Markus Sinnl 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.03.002
Recommendations
- scientific article; zbMATH DE number 949665
- Benders decomposition: solving binary master problems by enumeration
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- On the separability of subproblems in Benders decompositions
- The Benders dual decomposition method
branch-and-cutperspective reformulationBenders decompositioncongested capacitated facility locationmixed-integer convex programming
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- New variants of bundle methods
- Generalized Benders decomposition
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Perspective reformulation and applications
- The Cutting-Plane Method for Solving Convex Programs
- Implementing Mixed Integer Column Generation
- Facility location models for distribution system design
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- An effective heuristic for large-scale capacitated facility location problems
- The congested facility location problem
- A cutting plane algorithm for the capacitated facility location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Incorporating congestion in preventive healthcare facility network design
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Facility location with increasing production costs
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- An in-out approach to disjunctive optimization
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Title not available (Why is that?)
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A review of congestion models in the location of facilities with immobile servers
Cited In (58)
- Subproblem separation in logic-based Benders' decomposition for the vehicle routing problem with local congestion
- Adjustable robust optimization with objective uncertainty
- An enhanced Benders decomposition method for unique shortest path routing
- Three network design problems for community energy storage
- Solving the facility location and fixed charge solid transportation problem
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Approximation of the competitive facility location problem with MIPs
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
- Revisiting Lagrangian relaxation for network design
- A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone
- On the separability of subproblems in Benders decompositions
- A unified approach to mixed-integer optimization problems with logical constraints
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Outer approximation and submodular cuts for maximum capture facility location problems with random utilities
- New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty
- A Benders decomposition based framework for solving cable trench problems
- Multi-level facility location problems
- Solving minimum-cost shared arborescence problems
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Pricing and collection rate for remanufacturing industry considering capacity constraint in recycling channels
- The stochastic pseudo-star degree centrality problem
- A survey on bilevel optimization under uncertainty
- Modeling and mitigating supply chain disruptions as a bilevel network flow problem
- Exact method for the capacitated competitive facility location problem
- Implementing automatic benders decomposition in a modern MIP solver
- Large-scale influence maximization via maximal covering location
- On single-source capacitated facility location with cost and fairness objectives
- Weak flow cover inequalities for the capacitated facility location problem
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- The star degree centrality problem: a decomposition approach
- Joint location and pricing within a user-optimized environment
- A benders decomposition approach for static data segment location to servers connected by a tree backbone
- Revisiting Stackelberg p-median problem with user preferences
- Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness
- Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster
- A bilevel “Attacker–Defender” model to choosing the composition of attack means
- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- Benders decomposition for a period-aggregated resource leveling problem with variable job duration
- Mixed-integer formulations for the capacitated rank pricing problem with envy
- The Benders dual decomposition method
- A new perspective on low-rank optimization
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- A Scalable Algorithm for Sparse Portfolio Selection
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for publication: Benders decomposition without separability: a computational study for capacitated facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323204)
