The prize collecting traveling salesman problem: II. Polyhedral results

DOI10.1002/NET.3230250406zbMATH Open0843.90120OpenAlexW2033181249MaRDI QIDQ4861350FDOQ4861350

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

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

zbMATH Keywords

polytopefacet defining inequalityprize collecting traveling salesmandaily schedulessteel rolling mill

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (18)

• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Faster algorithms for orienteering and \(k\)-TSP
• Capacitated ring arborescence problems with profits
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
• The online prize-collecting traveling salesman problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• The prize collecting traveling 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
• Title not available (Why is that?)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem

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)