On the complexity of the Eulerian closed walk with precedence path constraints problem

被引：0

作者：

Kerivin, H. L. M. ^{[2
]}

Lacroix, M. ^{[1
]}

Mahjoub, A. R. ^{[1
]}

机构：

[1] Univ Blaise Pascal Clermont Ferrand II, CNRS UMR 6158, LIMOS, F-63177 Aubiere, France

[2] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA

来源：

THEORETICAL COMPUTER SCIENCE | 2012年 / 439卷

关键词：

Eulerian closed walk; Precedence path constraints; NP-completeness; Polynomial-time algorithm; DELIVERY PROBLEM; PICKUP;

D O I：

10.1016/j.tcs.2012.03.014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some precedence constraints specified by paths of the digraph, then the problem becomes NP-complete. We also present a polynomial-time algorithm to solve this variant of the Eulerian closed walk problem when the set of paths does not contain some forbidden structure. This allows us to give necessary and sufficient conditions for the existence of feasible solutions in this polynomial-time solvable case. (C) 2012 Published by Elsevier B.V.

引用

页码：16 / 29

页数：14

共 50 条

[41] Exact and heuristic methods for a workload allocation problem with chain precedence constraints
Pereira, Jordi
Ritt, Marcus
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) : 387 - 398
[42] GRASP for the Vehicle Routing Problem with Time Windows, synchronization and precedence constraints
Haddadene, Syrine Roufaida Ait
Labadie, Nacima
Prodhon, Caroline
2014 IEEE 10TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB), 2014, : 72 - 76
[43] A hybrid algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and time windows
Roohnavazfar, Mina
Pasandideh, Seyed Hamid Reza
Tadei, Roberto
COMPUTERS & OPERATIONS RESEARCH, 2022, 143
[44] Shortest path problem with multiple constraints
Chen, BTC
PROCEEDINGS OF THE ISCA 20TH INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS, 2005, : 133 - 138
[45] The quickest path problem with batch constraints
Calvete, HI
del Pozo, L
OPERATIONS RESEARCH LETTERS, 2003, 31 (04) : 277 - 284
[46] A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Norbert Ascheuer
Michael Jünger
Gerhard Reinelt
Computational Optimization and Applications, 2000, 17 : 61 - 84
[47] An Ant Colony Algorithm for the Sequential Testing Problem under Precedence Constraints
Catay, Buelent
Ozluk, Ozgur
Unluyurt, Tonguc
IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 1800 - +
[48] Solving the Traveling Salesperson Problem with Precedence Constraints by Deep Reinforcement Learning
Loewens, Christian
Ashraf, Inaam
Gembus, Alexander
Cuizon, Genesis
Falkner, Jonas K.
Schmidt-Thieme, Lars
ADVANCES IN ARTIFICIAL INTELLIGENCE, KI 2022, 2022, 13404 : 160 - 172
[49] Vehicle routing problem with time windows and precedence constraints and its algorithm
Ye, Yaohua
Zhu, Xiaomei
Chen, Lin
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2000, 20 (03): : 110 - 112
[50] A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints
Ascheuer, N
Jünger, M
Reinelt, G
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2000, 17 (01) : 61 - 84

← 1 2 3 4 5 →