Name
Abstract | ||
|---|---|---|
•The longest induced path problem is a challenging optimization problem.•We describe three different linear integer programming models.•We develop an exact iterative algorithm that exploits these models.•We describe a simple randomized heuristic.•Computational experiments with real and synthetic data are presented. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2019.04.011 | European Journal of Operational Research |
Keywords | Field | DocType |
Networks,Longest induced path problem,Maximum subgraph identification problem,Integer programming,Randomized heuristic | Discrete mathematics,Mathematical optimization,Heuristic,Path (graph theory),Shortest path problem,Induced path,Iterative method,Distance,Induced subgraph,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
278 | 2 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dmytro Matsypura | 1 | 11 | 2.68 |
| Alexander Veremyev | 2 | 163 | 15.36 |
| Oleg A. Prokopyev | 3 | 398 | 40.51 |
| Eduardo L. Pasiliao | 4 | 233 | 39.13 |