The Parking Warden Tour Problem (original) (raw)
Related papers
Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction : First Results
2009
An exact method for the minimum caterpillar spanning problem
2009
The open capacitated arc routing problem
André Luiz Morelato França, F. Usberti
Computers & Operations Research, 2011
Combinatorial Optimization Problems with Conflict Graphs
A backbone based TSP heuristic for large instances
Boris Goldengorin, Paul Molitor
The traveling salesman problem and its variations
2002
Packing paths: Recycling saves time
Discrete Applied Mathematics, 2013
The euclidean traveling salesman problem and a space-filling curve
Chaos, Solitons & Fractals, 1995
The Path-TSP: Two Solvable Cases
2020
Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones
Reoptimization of minimum and maximum traveling salesman's tours (février 2006)
HAL (Le Centre pour la Communication Scientifique Directe), 2006
Reoptimization of minimum and maximum traveling salesman's tours
Journal of Discrete Algorithms, 2009
Colored Trees in Edge-Colored Graphs
Carlos Martinhon, Valentin Borozan
Cologne Twente Workshop on Graphs and Combinatorical Optimization, 2009
ACM SIGACT News, 2009
A branch-and-price approach for the partition coloring problem
Operations Research Letters, 2011
Good triangulations yield good tours
Computers & Operations Research, 2008
Computers & Operations Research, 1999
The geometric maximum traveling salesman problem
Journal of the ACM, 2003
An alternate formulation of the symmetric traveling salesman problem and its properties
Discrete Applied Mathematics, 2000
On multi-agent knapsack problems
2009
Improving the efficiency of Helsgaun's Lin-Kernighan heuristic for the symmetric TSP.
A restricted Lagrangean approach to the traveling salesman problem
Mathematical Programming, 1981
Algorithms for the traveling Salesman Problem with Neighborhoods involving a dubins vehicle
Proceedings of the 2011 American Control Conference, 2011
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Traveling Salesman Problem, Theory and Applications, 2010
The Compatible Tour Heuristic for the Symmetric Traveling Salesman Problem
The symmetric generalized traveling salesman polytope
Networks, 1995
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem
Cologne Twente Workshop on Graphs and Combinatorical Optimization, 2009
Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
Central European Journal of Operations Research, 2021
k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic
A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks
Literature Review on Travelling Salesman Problem
International Journal of Research, 2018
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry - SCG '95, 1995
Approximation Algorithms for the Dubins' Traveling Salesman Problem
2005