Minimum directed 1-subtree relaxation for score orienteering problem
type: Item
instance of: scholarly article
title: Minimum directed 1-subtree relaxation for score orienteering problem
zbMATH Open document ID: 0955.90108
DOI: 10.1016/S0377-2217(96)00309-8
author: Seiji Kataoka
author: Takeo Yamada
author: Susumu Morito
published in: European Journal of Operational Research
publication date: 2001-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1299859
zbMATH Keywords: orienteering problem
zbMATH Keywords: minimum directed 1-subtree relaxation
zbMATH Keywords: traveling salesman problem
MaRDI profile type: Publication
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: The prize collecting traveling salesman problem
cites work: Q5567717
cites work: Optimum branchings
cites work: Q4205235
cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems
cites work: Packing rooted directed cuts in a weighted directed graph
cites work: `` Strong '' NP-Completeness Results
cites work: The orienteering problem
cites work: Q3795496
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: The selective travelling salesman problem
cites work: Q5187226
cites work: Strong linear programming relaxations for the orienteering problem
cites work: An Optimal Algorithm for the Orienteering Tour Problem
cites work: A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
cites work: Finding optimum branchings
cites work: A dual ascent approach for steiner tree problems on a directed graph
description: scientific article; zbMATH DE number 1299859