Strong linear programming relaxations for the orienteering problem
From MaRDI portal
Publication:1328645
DOI10.1016/0377-2217(94)90247-XzbMath0807.90087MaRDI QIDQ1328645
Moshe B. Rosenwein, Adrienne C. Leifer
Publication date: 1 March 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C10: Integer programming
90C05: Linear programming
90B06: Transportation, logistics and supply chain management
Related Items
A fast and effective heuristic for the orienteering problem, Minimum directed 1-subtree relaxation for score orienteering problem, A TSSP+1 decomposition strategy for the vehicle routing problem, Using artificial neural networks to solve the orienteering problem, Routing problems: A bibliography, A stabilized column generation scheme for the traveling salesman subtour problem
Uses Software
Cites Work