New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
Year of publication: |
2012
|
---|---|
Authors: | García, Sergio ; Landete, Mercedes ; Marín, Alfredo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 220.2012, 1 (1.7.), p. 48-57
|
Subject: | Theorie | Theory | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An empirical analysis of exact algorithms for the unbounded knapsack problem
Becker, Henrique, (2019)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
- More ...
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
-
Solving Large p-Median Problems with a Radius Formulation
García, Sergio, (2011)
- More ...