Minimum directed 1-subtree relaxation for score orienteering problem

DOI10.1016/S0377-2217(96)00309-8MaRDI QIDQ1291640zbMATH OpenFDO

Authors Seiji Kataoka, Takeo Yamada, Susumu Morito

Publication date 22 February 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(96)00309-8

zbMATH Keywords

minimum directed 1-subtree relaxationorienteering problemtraveling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• An Optimal Algorithm for the Orienteering Tour Problem
• Solving relaxation orienteering problem using DCA-CUT
• The orienteering problem
• scientific article; zbMATH DE number 4061010
• The orienteering problem: a survey

Cites work

• `` Strong NP-Completeness Results
• A dual ascent approach for steiner tree problems on a directed graph
• A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
• A restricted Lagrangean approach to the traveling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• An Optimal Algorithm for the Orienteering Tour Problem
• Finding optimum branchings
• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 4125195 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• scientific article; zbMATH DE number 3285076 (Why is no real title available?)
• Optimum branchings
• Packing rooted directed cuts in a weighted directed graph
• SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES
• Strong linear programming relaxations for the orienteering problem
• The orienteering problem
• The prize collecting traveling salesman problem
• The selective travelling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(5)

• Coupling ant colony systems with strong local searches
• A stabilized column generation scheme for the traveling salesman subtour problem
• A note on relatives to the Held and Karp 1-tree problem
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Solving relaxation orienteering problem using DCA-CUT

This page was built for publication: Minimum directed 1-subtree relaxation for score orienteering problem

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