Strong linear programming relaxations for the orienteering problem
type: Item
instance of: scholarly article
title: Strong linear programming relaxations for the orienteering problem
zbMATH Open document ID: 0807.90087
DOI: 10.1016/0377-2217(94)90247-X
author: Adrienne C. Leifer
author: Moshe B. Rosenwein
published in: European Journal of Operational Research
publication date: 1995-03-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 611363
zbMATH Keywords: relaxation
zbMATH Keywords: routing
zbMATH Keywords: orienteering problem
zbMATH Keywords: 0-1 integer program
zbMATH Keywords: NP-hard
zbMATH Keywords: upper bounds
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Q4205235
cites work: A Modeling Language for Mathematical Programming
cites work: The orienteering problem
cites work: Q3795496
cites work: Finding All the Elementary Circuits of a Directed Graph
cites work: A new polynomial-time algorithm for linear programming
cites work: Algorithms to solve the orienteering problem: A comparison
cites work: The selective travelling salesman problem
full work available at URL: 0377-2217(94)90247-x
OpenAlex ID: W2095032305
description: scientific article; zbMATH DE number 611363