Solving Relaxation Orienteering Problem Using DCA-CUT

DOI10.1007/978-3-319-18161-5_17zbMath1370.90228MaRDI QIDQ5356984

Hoai An Le Thi, Anh Son Ta, Trong Sy Ha

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_17

zbMATH Keywords

DC programming; orienteering problem; DC algorithm; binary linear integer program

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization