Polyhedral study of simple plant location problem with order
Year of publication: |
2013
|
---|---|
Authors: | Vasilyev, Igor ; Klimentova, Xenia ; Boccia, Maurizio |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 2, p. 153-158
|
Subject: | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics |
-
Planning for meals-on-wheels : algorithms and application
Yildiz, H., (2013)
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
Near-optimal disjoint-path facility location through set cover by pairs
Johnson, David S., (2020)
- More ...
-
Polyhedral study of simple plant location problem with order
Vasilyev, Igor, (2013)
-
A computational study of exact knapsack separation for the generalized assignment problem
Avella, Pasquale, (2010)
-
Computational experience with general cutting planes for the Set Covering problem
Avella, Pasquale, (2009)
- More ...