Combining VNS with constraint programming for solving anytime optimization problems
From MaRDI portal
Publication:932188
DOI10.1016/j.ejor.2006.12.062zbMath1160.90661OpenAlexW2090825708MaRDI QIDQ932188
Patrice Boizumault, Samir Loudni
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.062
Related Items
Anytime Pareto local search, Automatically improving the anytime behaviour of optimisation algorithms, Variable neighbourhood search: methods and applications, A unified framework for partial and hybrid search methods in constraint programming, On-line resources allocation for ATM networks with rerouting, A model of anytime algorithm performance for bi-objective optimization, Variable neighbourhood search: Methods and applications, Exploiting Separators for Guiding VNS
Uses Software
Cites Work
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Maintaining reversible DAC for Max-CSP
- Radio link frequency assignment
- The partial constraint satisfaction problem: Facets and lifting theorems
- Deliberation scheduling for problem solving in time-constrained environments
- Variable neighborhood search
- Guided local search and its application to the traveling salesman problem
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Earth observation satellite management
- Variable neighborhood decomposition search
- On-line resources allocation for ATM networks with rerouting
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Resource allocation in a mobile telephone network: A constructive repair algorithm
- Principles of Constraint Programming
- A Computational Study of the Job-Shop Scheduling Problem
- Local Search and Constraint Programming
- Principles and Practice of Constraint Programming – CP 2003
- Monitoring and control of anytime algorithms: A dynamic programming approach
- Using constraint-based operators to solve the vehicle routing problem with time windows
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item