All Stories

  1. Solving the slab selection and relocation problem in a real production yard using simulated annealing
  2. A compact model for the home healthcare routing and scheduling problem
  3. Multi‐neighborhood simulated annealing for the home healthcare routing and scheduling problem
  4. Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
  5. EasyLocal++ a 25-year Perspective on Local Search Frameworks
  6. Solving the medical student scheduling problem using simulated annealing
  7. Reinforcement Learning for Multi-Neighborhood Local Search in Combinatorial Optimization
  8. Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling
  9. Solving the Integrated Patient-to-Room and Nurse-to-Patient Assignment by Simulated Annealing
  10. Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem
  11. Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities
  12. Local Search for Integrated Predictive Maintenance and Scheduling in Flow-Shop
  13. Simulated Annealing for the Home Healthcare Routing and Scheduling Problem
  14. Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities
  15. Task design in complex crowdsourcing experiments: Item assignment optimization
  16. Educational Timetabling: Problems, Benchmarks, and State-of-the-Art Results
  17. Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
  18. Exact and metaheuristic approaches for unrelated parallel machine scheduling
  19. Multi-Neighborhood Simulated Annealing for the Minimum Interference Frequency Assignment Problem
  20. Correction to: Solving a home energy management problem by Simulated Annealing
  21. Solving a home energy management problem by SA
  22. Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods
  23. Local Search and Constraint Programming for a Real-World Examination Timetabling Problem
  24. Modelling and solving the thesis defense timetabling problem
  25. The practice and theory of automated timetabling (2016)
  26. Modeling and solving the steelmaking and casting scheduling problem
  27. The Second International Nurse Rostering Competition
  28. Solving discrete lot-sizing and scheduling by simulated annealing and mixed integer programming
  29. Modeling and solving a real-life multi-skill shift design problem
  30. Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
  31. Feature-based tuning of single-stage simulated annealing for examination timetabling
  32. Comments on: An overview of curriculum-based course timetabling
  33. Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
  34. Local search techniques for a routing-packing problem
  35. The generalized balanced academic curriculum problem with heterogeneous classes
  36. The Third International Timetabling Competition
  37. Automated Shift Design and Break Scheduling
  38. Modeling and solving the dynamic patient admission scheduling problem under uncertainty
  39. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
  40. The first international nurse rostering competition 2010
  41. XHSTT: an XML archive for high school timetabling problems in different countries
  42. Hybrid metaheuristics for constrained portfolio selection problems
  43. Local search and lower bounds for the patient admission scheduling problem
  44. Local search for a multi-drop multi-container loading problem
  45. Design and statistical analysis of a hybrid local search algorithm for course timetabling
  46. The balanced academic curriculum problem revisited
  47. Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings
  48. Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
  49. Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
  50. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
  51. A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
  52. Multi-neighborhood Local Search for the Patient Admission Problem
  53. Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
  54. The minimum shift design problem
  55. Simulation of fuel consumption and emissions in typical traffic circumstances in Belgium
  56. A composite-neighborhood tabu search approach to the traveling tournament problem
  57. Hybrid Local Search for Constrained Financial Portfolio Selection Problems
  58. Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals
  59. EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
  60. EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms
  61. Floating Automotive Data Collection
  62. Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
  63. Simulations of Fuel Consumption and Emissions in Typical Traffic Circumstances
  64. Compiling problem specifications into SAT
  65. Theory and Practice of the Minimum Shift Design Problem
  66. Local search for shift design
  67. Writing Local Search Algorithms Using Easylocal++
  68. Multi-neighbourhood Local Search with Application to Course Timetabling
  69. The Minimum Shift Design Problem: Theory and Practice
  70. EASYLOCAL++: an object-oriented framework for the flexible design of local-search algorithms
  71. Tabu Search Techniques for Examination Timetabling
  72. NP-SPEC: an executable specification language for solving all problems in NP
  73. LOCAL++: A C++ framework for local search algorithms
  74. LOCAL++: A C++ framework for local search algorithms
  75. Solving Employee Timetabling Problems by Generalized Local Search
  76. Local search techniques for large high school timetabling problems
  77. The Alma Project, or How First-Order Logic Can Help us in Imperative Programming
  78. Alma-O: an imperative language that supports declarative programming
  79. An epistemic operator for description logics
  80. A refined architecture for terminological systems: Terminology = Schema + Views
  81. np-spec: An Executable Specification Language for Solving All Problems in NP
  82. Search and imperative programming
  83. Experimental analysis of the computational cost of evaluating Quantified Boolean Formulae
  84. Reasoning with individuals in concept languages
  85. Deduction in Concept Languages: from Subsumption to Instance Checking
  86. Queries, rules and definitions as epistemic sentences in concept languages
  87. On the complexity of the instance checking problem in concept languages with existential quantification
  88. Reasoning with individuals in concept languages
  89. On the complexity of the instance checking problem in concept languages with existential quantification
  90. A hybrid system with datalog and concept languages
  91. Compiling Problem Specifications into SAT
  92. Querying concept-based knowledge bases
  93. Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
  94. LOCAL++: a C++ framework for local search algorithms