On exact solution approaches for the longest induced path problem-Reference-Cited by-同舟云学术

On exact solution approaches for the longest induced path problem

Published:2019-10 Issue:2 Volume:278 Page:546-562
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Matsypura Dmytro,Veremyev Alexander,Prokopyev Oleg A.^ORCID,Pasiliao Eduardo L.

Funder

National Science Foundation

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference36 articles.

1. Network flows: Theory, algorithms, and applications;Ahuja,1993

2. Statistical mechanics of complex networks;Albert;Reviews of Modern Physics,2002

3. Emergence of scaling in random networks;Barabási;Science,1999

4. Network science;Barabási,2016

5. Batagelj, V., & Mrvar, A. (2009). Pajek datasets (2006). http://vlado.fmf.uni-lj.si/pub/networks/data.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem;Annals of Operations Research;2023-09-28

2. Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches;European Journal of Operational Research;2023-08

3. MIP formulations for induced graph optimization problems: a tutorial;International Transactions in Operational Research;2023-04-17

4. Integer programming formulations for the k‐in‐a‐tree problem in graphs;International Transactions in Operational Research;2023-04-14

5. The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study;Information Sciences;2022-10