All Stories

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