The prize collecting traveling salesman problem: II. Polyhedral results

DOI10.1002/net.3230250406zbMath0843.90120OpenAlexW2033181249MaRDI QIDQ4861350

Egon 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)

Related Items (13)

Faster algorithms for orienteering and \(k\)-TSP ⋮ A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs ⋮ Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem ⋮ Hybrid genetic algorithm for undirected traveling salesman problems with profits ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ Unnamed Item ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ 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 metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times ⋮ A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem ⋮ A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem ⋮ Capacitated ring arborescence problems with profits

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