On solving close enough orienteering problems with overlapped neighborhoods.
Qiuchen QianYanran WangDavid BoylePublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- solving problems
- np complete
- machine learning
- data sets
- solving complex
- combinatorial optimization
- quadratic optimization problems
- convex quadratic programming
- examination timetabling
- sat encodings
- linear programming problems
- search heuristics
- linear systems
- problems involving
- information content
- knapsack problem
- decision problems
- linear program
- objective function
- bayesian networks
- decision trees