Solving Relaxation Orienteering Problem Using DCA-CUT

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

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

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 programmingorienteering problemDC algorithmbinary linear integer program

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

DC programming and DCA: thirty years of developments

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• The selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• A fast and effective heuristic for the orienteering problem
• A heuristic for the multiple tour maximum collection problem
• A continuous approch for globally solving linearly constrained quadratic
• The orienteering problem
• The prize collecting traveling salesman problem
• The Orienteering Problem with Time Windows

This page was built for publication: Solving Relaxation Orienteering Problem Using DCA-CUT