Solving the longest simple path problem with constraint-based techniques

Authors:
Quang Dung Pham;Yves Deville
Affiliations:
School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam;ICTEAM Institute, Université catholique de Louvain, Louvain-la-Neuve, Belgium
Venue:
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2012

Citing 6
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

Networks
Information retrieval in P2P networks using genetic algorithm

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning

Proceedings of the 2010 ACM Symposium on Applied Computing
Constraint-Based local search for constrained optimum paths problems

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The longest simple path problem on graphs arises in a variety of context, e.g., information retrieval, VLSI design, robot patrolling. Given an undirected weighted graph G =(V ,E ), the problem consists of finding the longest simple path (i.e., no vertex occurs more than once) on G . We propose in this paper an exact and a tabu search algorithm for solving this problem. We show that our techniques give competitive results on different kinds of graphs, compared with recent genetic algorithms.