Minimum Spanning Trees with neighborhoods : mathematical programming formulations and solution methods
Year of publication: |
1 November 2017
|
---|---|
Authors: | Blanco, Víctor ; Fernández, Elena ; Puerto, Justo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 262.2017, 3 (1.11.), p. 863-878
|
Subject: | Combinatorial Optimization | Minimum Spanning Trees | Neighborhoods | Mixed Integer Non Linear Programming | Second order cone programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
-
Facility location problems on graphs with non-convex neighborhoods
Espejo Miranda, Inmaculada, (2023)
-
An alternative approach for proving the NP-hardness of optimization problems
Cheng, T. C. E., (2016)
-
The multiple container loading problem with preference
Tian, Tian, (2016)
- More ...
-
Hub location with protection under interhub link failures
Blanco, Víctor, (2023)
-
On the fuzzy maximal covering location problem
Arana-Jiménez, Manuel, (2020)
-
Expanding the Spanish high-speed railway network
Blanco, Víctor, (2011)
- More ...