MIP model-based heuristics for the minimum weighted tree reconstruction problem
Year of publication: |
2022
|
---|---|
Authors: | Fajarda, Olga ; Requejo, Cristina |
Subject: | Mixed integer linear programming | Balanced minimum evolution problem | Feasibility pump | Local branching | Matheuristics | Minimum evolution problem | Routing topology inference | Topology discovery | Tree realization | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory |
-
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
Fortz, Bernard, (2017)
-
Benavent, Enrique, (2023)
-
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem
Dell'Amico, Mauro, (2020)
- More ...
-
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
Gouveia, Luis, (2001)
-
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
Gouveia, Luis, (2001)
-
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
Gouveia, Luis, (2006)
- More ...