A personal perspective on problem solving by general purpose solvers

DOI10.1111/j.1475-3995.2009.00752.xzbMath1189.90209OpenAlexW2073501943MaRDI QIDQ3566446

Toshihide Ibaraki

Publication date: 8 June 2010

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00752.x

zbMATH Keywords

metaheuristicslocal searchtimetablingdiscrete optimizationconstraint satisfactionnurse schedulingwork shift scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• The vehicle routing problem with flexible time windows and traveling times
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
• Local search algorithms for the rectangle packing problem with general spatial costs
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Metaheuristics. Progress as real problem solvers. Selected papers from the fifth Metaheuristic International Conference, MIC 2003, Kyoto, Japan, August 25--28, 2003
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• An Ejection Chain Approach for the Generalized Assignment Problem
• Solving the irregular strip packing problem via guided local search for overlap minimization
• Handbook of Approximation Algorithms and Metaheuristics
• Tabu Search—Part I
• A variable depth search algorithm with branching search for the generalized assignment problem
• Handbook of metaheuristics
• Constraint programming and operations research: comments from an operations researcher