An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
From MaRDI portal
Publication:5888195
DOI10.1080/03155986.2001.11732431MaRDI QIDQ5888195
Koji Nonobe, Toshihide Ibaraki
Publication date: 24 April 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2001.11732431
scheduling; tabu search; combinatorial optimization problem; weighted constraint satisfaction problem; general problem solver
90-XX: Operations research, mathematical programming
Related Items
Effective learning hyper-heuristics for the course timetabling problem, Fast machine reassignment, Using tabu search with longer-term memory and relaxation to create examination timetables., Relaxation heuristics for the set multicover problem with generalized upper bound constraints, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem