Benders decomposition without separability: a computational study for capacitated facility location problems
From MaRDI portal
Publication:323204
DOI10.1016/j.ejor.2016.03.002zbMath1346.90490OpenAlexW2301790113MaRDI QIDQ323204
Markus Sinnl, Matteo Fischetti, Ivana Ljubić
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
branch-and-cutBenders decompositionperspective reformulationcongested capacitated facility locationmixed-integer convex programming
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Implementing Automatic Benders Decomposition in a Modern MIP Solver, New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, Exact method for the capacitated competitive facility location problem, The Star Degree Centrality Problem: A Decomposition Approach, A Scalable Algorithm for Sparse Portfolio Selection, 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, Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness, Benders decomposition for a period-aggregated resource leveling problem with variable job duration, Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster, Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs, Mixed-integer formulations for the capacitated rank pricing problem with envy, Revisiting Lagrangian relaxation for network design, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, A new perspective on low-rank optimization, Revisiting Stackelberg p-median problem with user preferences, Adjustable robust optimization with objective uncertainty, A b<scp>ranch‐and‐cut</scp> approach and alternative formulations for the traveling salesman problem with drone, A survey on bilevel optimization under uncertainty, The stochastic pseudo-star degree centrality problem, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Pricing and collection rate for remanufacturing industry considering capacity constraint in recycling channels, The Benders Dual Decomposition Method, Benders decomposition for very large scale partial set covering and maximal covering location problems, Approximation of the competitive facility location problem with MIPs, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Solving the facility location and fixed charge solid transportation problem, Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Solving minimum-cost shared arborescence problems, Outer approximation and submodular cuts for maximum capture facility location problems with random utilities, Multi-level facility location problems, Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Large-scale influence maximization via maximal covering location, Weak flow cover inequalities for the capacitated facility location problem, On single-source capacitated facility location with cost and fairness objectives, 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, Joint location and pricing within a user-optimized environment, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Modeling and mitigating supply chain disruptions as a bilevel network flow problem, Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems, Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
Cites Work
- Unnamed Item
- Facility location models for distribution system design
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A cutting plane algorithm for the capacitated facility location problem
- A review of congestion models in the location of facilities with immobile servers
- A branch-and-price algorithm for the capacitated facility location problem
- Incorporating congestion in preventive healthcare facility network design
- An effective heuristic for large-scale capacitated facility location problems
- Partitioning procedures for solving mixed-variables programming problems
- Facility location with increasing production costs
- New variants of bundle methods
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- 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
- 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
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- The congested facility location problem
- Implementing Mixed Integer Column Generation
