The prize collecting traveling salesman problem: II. Polyhedral results

DOI10.1002/NET.3230250406MaRDI QIDQ4861350zbMATH OpenOpenAlexFDO

Authors E. Balas

Publication date 19 August 1996

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230250406

zbMATH Keywords

polytopefacet defining inequalityprize collecting traveling salesmandaily schedulessteel rolling mill

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The prize collecting traveling salesman problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• scientific article; zbMATH DE number 4125195
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• scientific article; zbMATH DE number 1342134

Cited in

(18)

• Faster algorithms for orienteering and \(k\)-TSP
• The prize collecting traveling salesman problem
• Capacitated ring arborescence problems with profits
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
• scientific article; zbMATH DE number 1517142 (Why is no real title available?)
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• The online prize-collecting traveling salesman problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

This page was built for publication: The prize collecting traveling salesman problem: II. Polyhedral results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4861350)