Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
From MaRDI portal
Publication:6091422
DOI10.1111/itor.13039OpenAlexW3187236644MaRDI QIDQ6091422
Unnamed Author, Mauricio C. de Souza
Publication date: 24 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13039
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Natural and extended formulations for the time-dependent traveling salesman problem
- A note on the prize collecting traveling salesman problem
- Non delayed relax-and-cut algorithms
- Combined route capacity and route length models for unit demand vehicle routing problems
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Dynamic programming algorithms for the zero-one knapsack problem
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- The volume algorithm revisited: relation with bundle methods
- The volume algorithm: Producing primal solutions with a subgradient method
- The hot strip mill production scheduling problem: A tabu search approach
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Lagrangean relaxation. (With comments and rejoinder).
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A New Formulation for the Travelling Salesman Problem
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- The prize collecting traveling salesman problem
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Solving the Orienteering Problem through Branch-and-Cut
- The prize collecting traveling salesman problem: II. Polyhedral results
- A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics
- A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem
- An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
This page was built for publication: Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
