Combining incomplete search and clause generation: an application to the orienteering problems with time windows

DOI10.1007/978-3-031-33271-5_32MaRDI QIDQ6057284

Hélène Fargier, Cédric Pralet, Trong-Hieu Tran

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

zbMATH Keywords

orienteering problem with time windowsincomplete searchclause generation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The orienteering problem: a survey
• Iterated local search for the team orienteering problem with time windows
• Boosting complete techniques thanks to local search methods
• Logic-based Benders decomposition
• An effective large neighborhood search for the team orienteering problem with time windows
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• A constraint programming framework for local search methods
• Solving RCPSP/max by lazy clause generation
• Efficient SAT Solving under Assumptions
• The Relation Between Complete and Incomplete Search
• DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Dynamic Programming Treatment of the Travelling Salesman Problem
• Graph-Based Algorithms for Boolean Function Manipulation
• The orienteering problem
• The Orienteering Problem with Time Windows
• Boosting Local Search Thanks to cdcl
• Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction