On exact solution approaches for the longest induced path problem
Year of publication: |
2019
|
---|---|
Authors: | Matsypura, Dmytro ; Veremyev, Alexander ; Prokopyev, Oleg ; Pasiliao, Eduardo L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 278.2019, 2 (16.10.), p. 546-562
|
Subject: | Networks | Longest induced path problem | Maximum subgraph identification problem | Integer programming | Randomized heuristic | Theorie | Theory | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Design of a min-sum arborescence with outage costs
Kawatra, Rakesh, (2013)
-
Design of capacitated degree constrained min-sum arborescence
Kawatra, Rakesh, (2022)
-
Lagrangian relaxation based heuristic for an integrated production and maintenance planning problem
Alaoui-Selsouli, M., (2012)
- More ...
-
Finding the most degree-central walks and paths in a graph : exact and heuristic approaches
Matsypura, Dmytro, (2023)
-
Fortification against cascade propagation under uncertainty
Gillen, Colin P., (2021)
-
Veremyev, Alexander, (2022)
- More ...