A fast exact method for the capacitated facility location problem with differentiable convex production costs
Year of publication: |
2021
|
---|---|
Authors: | Christensen, Tue Rauff Lind ; Klose, Andreas |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 292.2021, 3 (1.8.), p. 855-868
|
Subject: | Branch and bound | Integer programming | Location | Nonlinear programming | Theorie | Theory | Beziehungsmarketing | Relationship marketing | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice |
-
A scaleable projection‐based branch‐and‐cut algorithm for the p‐center problem
Gaar, Elisabeth, (2022)
-
A column generation heuristics for congested facility location problem with clearing functions
Kim, S., (2013)
-
A general corridor method-based approach for capacitated facility location
Caserta, Marco, (2020)
- More ...
-
Network design problems with piecewise linear cost functions
Christensen, Tue Rauff Lind, (2013)
-
Lower bounds for the capacitated facility location problem based on column generation
Klose, Andreas, (2001)
-
Combinatorial optimisation problems of the assignment type and a partitioning approach
Klose, Andreas, (2001)
- More ...