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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Betriebliche Standortwahl | Firm location choice | Ganzzahlige Optimierung | Produktionskosten | Production costs | Nichtlineare Optimierung | Branch-and-Bound | Branch and Bound |
-
Meier, Fabian, (2017)
-
Bounded branch and bound method for mixed integer nonlinear programming problems
Akoka, Jacob, (1977)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
- 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 ...