The orienteering problem with variable profits

DOI10.1002/net.21496zbMath1269.90123MaRDI QIDQ5326782

Gilbert Laporte, Güneş Erdoğan

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://opus.bath.ac.uk/41196/1/opvp_golden_with_keywords.pdf

zbMATH Keywords

integer programming; linearization; branch-and-cut; orienteering problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C25: Convex programming

90C10: Integer programming

Uses Software

• TSPLIB