Benders decomposition for very large scale partial set covering and maximal covering location problems
Year of publication: |
2019
|
---|---|
Authors: | Cordeau, Jean-François ; Furini, Fabio ; Ljubić, Ivana |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 275.2019, 3 (16.6.), p. 882-896
|
Subject: | Combinatorial optimization | Location problems | Covering | Benders decomposition | Branch-and-cut algorithms | Dekompositionsverfahren | Decomposition method | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Standorttheorie | Location theory | Tourenplanung | Vehicle routing problem |
-
Approximation algorithm for uniform bounded facility location problem
Kerui, Weng, (2013)
-
New formulations for two location problems with interconnected facilities
Kuzbakov, Yerlan, (2024)
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, Abílio, (2024)
- More ...
-
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Furini, Fabio, (2017)
-
The maximum clique interdiction problem
Furini, Fabio, (2019)
-
Decomposition methods for hard optimization problems
Furini, Fabio, (2020)
- More ...