scientific article; zbMATH DE number 949665
From MaRDI portal
Publication:4716341
Recommendations
- Benders decomposition without separability: a computational study for capacitated facility location problems
- scientific article; zbMATH DE number 4204108
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- A Cross Decomposition Algorithm for Capacitated Facility Location
Cited in
(45)- Modeling and optimizing of strategic and tactical production planning in the automotive industry under uncertainty
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- A Benders decomposition based framework for solving cable trench problems
- Stochastic survivable network design problems: theory and practice
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Regularized decomposition of large scale block-structured robust optimization problems
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Large-scale influence maximization via maximal covering location
- Capacitated multi-period maximal covering location problem with server uncertainty
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- On generating maximal nondominated Benders cuts
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- A note on the selection of Benders' cuts
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Accelerating Benders decomposition by local branching
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A note on node aggregation and Benders' decomposition
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- Solving a dynamic facility location problem with partial closing and reopening
- Acceleration of the HAP approach for the multifacility location problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- scientific article; zbMATH DE number 4020811 (Why is no real title available?)
- Accelerating Benders decomposition with heuristic master problem solutions
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Pareto-optimality of the Balinski cut for the uncapacitated facility location problem
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Design of survivable wireless backhaul networks with reliability considerations
- Optimizing service networks to support freight rail decarbonization: flow selection, facility location, and energy sourcing
- Facility location models for distribution system design
- A novel Pareto-optimal cut selection strategy for Benders decomposition
- Tailored Benders decomposition for two-stage distributionally robust combinatorial optimisation
- Analysis of decomposition algorithms with Benders cuts for p-median problem
- A branch-and-price algorithm for the capacitated facility location problem
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716341)
