All Stories

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