Discrete Mathematics - First Japan Conference on Graph Theory and Applications
NP-completeness of graph decomposition problems
Journal of Complexity
Bounded vertex colorings of graphs
Discrete Mathematics
Restrictions of graph partition problems. Part I
Theoretical Computer Science
Theoretical Computer Science
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Scheduling with conflicts, and applications to traffic signal control
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Linear-time transitive orientation
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Bounded vertex coloring of trees
Discrete Mathematics
Scheduling Computer and Manufacturing Processes
Scheduling Computer and Manufacturing Processes
On the Complexity of Scheduling Incompatible Jobs with Unit-Times
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Equitable and m-Bounded Coloring of Split Graphs
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
On Complexity of Some Chain and Antichain Partition Problems
WG '91 Proceedings of the 17th International Workshop
On Improved Time Bounds for Permutation Graph Problems
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
The mutual exclusion scheduling problem for permutation and comparability graphs
Information and Computation
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
Computers and Operations Research
The stable set problem and the thinness of a graph
Operations Research Letters
The uncapacitated asymmetric traveling salesman problem with multiple stacks
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Differential approximation of the multiple stacks TSP
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
INFORMS Journal on Computing
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
Computers and Operations Research
| Hi-index | 5.23 |
The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacks and repacking is not allowed. Given a pickup and a delivery tour, the problem of checking if there exists a valid distribution of items into s stacks of size h that is consistent with the given tours, is known as Pickup and Delivery Tour Combination (PDTC) problem. In the paper, we show that the PDTC problem can be solved in polynomial time when the number of stacks s is fixed but the size of each stack is not. We build upon the equivalence between the PDTC problem and the bounded coloring (BC) problem on permutation graphs: for the latter problem, s is the number of colors and h is the number of vertices that can get a same color. We show that the BC problem can be solved in polynomial time when s is a fixed constant on co-comparability graphs, a superclass of permutation graphs. To the contrary, the BC problem is known to be hard on permutation graphs when h=6 is a fixed constant, but s is unbounded.