Solving relaxation orienteering problem using DCA-CUT

DOI10.1007/978-3-319-18161-5_17MaRDI QIDQ5356984zbMATH OpenOpenAlexFDO

Authors Anh Son Ta, Le Thi Hoai An, 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

binary linear integer programDC algorithmDC programmingorienteering problem

Mathematics Subject Classification ID

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

Recommendations

• Solving the Orienteering Problem through Branch-and-Cut
• Minimum directed 1-subtree relaxation for score orienteering problem
• An Optimal Algorithm for the Orienteering Tour Problem
• The orienteering problem: a survey
• Strong linear programming relaxations for the orienteering problem

Cites work

• A continuous approch for globally solving linearly constrained quadratic
• A fast and effective heuristic for the orienteering problem
• A heuristic for the multiple tour maximum collection problem
• Algorithms to solve the orienteering problem: A comparison
• scientific article; zbMATH DE number 3878634 (Why is no real title available?)
• The orienteering problem
• The Orienteering Problem with Time Windows
• The orienteering problem: a survey
• The prize collecting traveling salesman problem
• The selective travelling salesman problem

Cited in

(3)

• Minimum directed 1-subtree relaxation for score orienteering problem
• Strong linear programming relaxations for the orienteering problem
• DC programming and DCA: thirty years of developments

This page was built for publication: Solving relaxation orienteering problem using DCA-CUT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5356984)