A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
From MaRDI portal
Publication:526844
DOI10.1007/s10107-016-1067-6zbMath1365.90169OpenAlexW2211794610WikidataQ57568246 ScholiaQ57568246MaRDI QIDQ526844
Jordi Castro, Stefano Nasini, Francisco Saldanha-Da-gama
Publication date: 15 May 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.12210/19847
large-scale optimizationinterior-point methodscutting planesBenders decompositionmixed integer linear optimizationmulti-period facility location
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Interior-point methods (90C51) Discrete location and assignment (90B80)
Related Items (17)
A fast algorithm for the rectilinear distance location problem ⋮ A new Lagrangian-Benders approach for a concave cost supply chain network design problem ⋮ An improved approximation algorithm for capacitated correlation clustering problem ⋮ Approximation algorithm for the capacitated correlation clustering problem with penalties ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon ⋮ An integrated planning model in centralized power systems ⋮ Time-flexible min completion time variance in a single machine by quadratic programming ⋮ Optimized assignment patterns in mobile edge cloud networks ⋮ An almost exact solution to the min completion time variance in a single machine ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ An accelerated L-shaped method for solving two-stage stochastic programs in disaster management ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Approximation algorithms for the capacitated correlation clustering problem with penalties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering-based preconditioning for stochastic programs
- Mathematical programming approaches for classes of random network problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- A warm-start approach for large-scale stochastic linear programs
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Modeling and solving a logging camp location problem
- The multi-period incremental service facility location problem
- Facility location and supply chain management. A review
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Parallel interior-point solver for structured linear programs
- The volume algorithm: Producing primal solutions with a subgradient method
- Multiple centrality corrections in a primal-dual method for linear programming
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- New developments in the primal-dual column generation technique
- An augmented Lagrangian decomposition method for block diagonal linear programming problems
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- An interior-point approach for primal block-angular problems
- Interior-point solver for convex separable block-angular problems
- An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization
- Accelerating Benders Decomposition by Local Branching
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Inexact Cuts in Benders Decomposition
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- Validation of subgradient optimization
- Location Science
This page was built for publication: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
