An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

DOI10.1080/03155986.2001.11732431OpenAlexW2271441614MaRDI 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

zbMATH Keywords

schedulingtabu searchcombinatorial optimization problemweighted constraint satisfaction problemgeneral problem solver

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (max. 100)

Effective learning hyper-heuristics for the course timetabling problem ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ Fast machine reassignment ⋮ 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 ⋮ Using tabu search with longer-term memory and relaxation to create examination timetables.

This page was built for publication: An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem