A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
type: Item
instance of: scholarly article
title: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
zbMATH Open document ID: 1365.90169
author: Jordi Castro
author: Stefano Nasini
author: Francisco Saldanha-da-Gama
published in: Mathematical Programming. Series A. Series B
publication date: 2017-05-15T00:00:00Z
full work available at URL: http://hdl.handle.net/20.500.12210/19847
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6715573
zbMATH Keywords: mixed integer linear optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: multi-period facility location
zbMATH Keywords: cutting planes
zbMATH Keywords: Benders decomposition
zbMATH Keywords: large-scale optimization
describes a project that uses: IPM
describes a project that uses: OOPS
MaRDI profile type: Publication
OpenAlex ID: W2211794610
cites work: The multi-period incremental service facility location problem
cites work: A computational comparison of several formulations for the multi-period incremental service facility location problem
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Partitioning procedures for solving mixed-variables programming problems. Reprint
cites work: Clustering-based preconditioning for stochastic programs
cites work: A Specialized Interior-Point Algorithm for Multicommodity Network Flows
cites work: An interior-point approach for primal block-angular problems
cites work: Interior-point solver for convex separable block-angular problems
cites work: Quadratic regularizations in an interior-point method for primal block-angular problems
cites work: Mathematical programming approaches for classes of random network problems
cites work: Q3323698
cites work: A warm-start approach for large-scale stochastic linear programs
cites work: Q3351135
cites work: Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: Multiple centrality corrections in a primal-dual method for linear programming
cites work: Parallel interior-point solver for structured linear programs
cites work: Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
cites work: New developments in the primal-dual column generation technique
cites work: Validation of subgradient optimization
cites work: Modeling and solving a logging camp location problem
cites work: Q3316093
cites work: Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
cites work: Parallel distributed-memory simplex for large-scale stochastic LP problems
cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
cites work: Q3352833
cites work: Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
cites work: Facility location and supply chain management. A review
cites work: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
cites work: Using the primal-dual interior point algorithm within the branch-price-and-cut method
cites work: Location Science
cites work: Inexact Bundle Methods for Two-Stage Stochastic Programming
cites work: An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization
cites work: Accelerating Benders decomposition by local branching
cites work: Q3741418
cites work: An augmented Lagrangian decomposition method for block diagonal linear programming problems
cites work: Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
cites work: Q4716341
cites work: Q5691079
cites work: Inexact Cuts in Benders Decomposition
Wikidata QID: Q57568246
DOI: 10.1007/S10107-016-1067-6
description: scientific article; zbMATH DE number 6715573