A fast exact method for the capacitated facility location problem with differentiable convex production costs
From MaRDI portal
Publication:2030454
DOI10.1016/j.ejor.2020.11.048zbMath1487.90433OpenAlexW3112122368MaRDI QIDQ2030454
Tue Rauff Lind Christensen, Andreas Klose
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.048
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Discrete location and assignment (90B80)
Related Items (2)
Location and two-echelon inventory network design with economies and diseconomies of scale in facility operating costs ⋮ Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway
Uses Software
Cites Work
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17--21, 2008
- 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
- Incorporating inventory and routing costs in strategic location models
- A branch-and-price algorithm for the capacitated facility location problem
- Approximate solutions to large scale capacitated facility location problems
- Two ``well-known properties of subgradient optimization
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Solution procedures for the service system design problem
- The capacitated plant location problem
- A Lagrangean heuristic for a modular capacitated location problem
- Exact solution methods for uncapacitated location problems with convex transportation costs
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
- Facility location with increasing production costs
- An inventory-location model: Formulation, solution algorithm and computational results
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Location of slaughterhouses under economies of scale
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Generalized Benders decomposition
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- 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
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Capacitated warehouse location model with risk pooling
- The congested facility location problem
- An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
- Optimal Facility Location with Concave Costs
- Stochastic Transportation-Inventory Network Design Problem
- Nonlinear Programming
- Uncapacitated and Capacitated Facility Location Problems
This page was built for publication: A fast exact method for the capacitated facility location problem with differentiable convex production costs
