The following pages link to Andrea Schaerf (Q284391):
Displaying 43 items.
- The third international timetabling competition (Q284392) (← links)
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays (Q309052) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← links)
- The generalized balanced academic curriculum problem with heterogeneous classes (Q475183) (← links)
- The first international nurse rostering competition 2010 (Q475197) (← links)
- XHSTT: an XML archive for high school timetabling problems in different countries (Q475206) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- Local search and lower bounds for the patient admission scheduling problem (Q632698) (← links)
- (Q1128644) (redirect page) (← links)
- A refined architecture for terminological systems: Terminology = Schema + Views (Q1128645) (← links)
- An epistemic operator for description logics (Q1128772) (← links)
- Scheduling sport tournaments using constraint logic programming (Q1294044) (← links)
- Modelling and solving employee timetabling problems (Q1397236) (← links)
- Local search for shift design. (Q1417484) (← links)
- Local search techniques for constrained portfolio selection problems (Q1872059) (← links)
- Local search and constraint programming for a real-world examination timetabling problem (Q2110389) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- Feature-based tuning of single-stage simulated annealing for examination timetabling (Q2398423) (← links)
- Modeling and solving a real-life multi-skill shift design problem (Q2398430) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- The minimum shift design problem (Q2468734) (← links)
- Neighborhood portfolio approach for local search applied to timetabling problems (Q2506215) (← links)
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling (Q2668746) (← links)
- Task design in complex crowdsourcing experiments: item assignment optimization (Q2676398) (← links)
- (Q2729760) (← links)
- NP-SPEC: an executable specification language for solving all problems in NP (Q2755406) (← links)
- (Q2763686) (← links)
- (Q2779804) (← links)
- (Q2782477) (← links)
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition (Q2899043) (← links)
- Hybrid Local Search for Constrained Financial Portfolio Selection Problems (Q3612406) (← links)
- Deduction in Concept Languages: from Subsumption to Instance Checking (Q4305351) (← links)
- (Q4386924) (← links)
- (Q4514013) (← links)
- (Q4547451) (← links)
- Hybrid metaheuristics for constrained portfolio selection problems (Q4911224) (← links)
- Algorithms - ESA 2003 (Q5897279) (← links)
- Comments on: ``An overview of curriculum-based course timetabling'' (Q5971109) (← links)
- Modeling and solving the steelmaking and casting scheduling problem (Q6066683) (← links)
- Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)
- Exact and metaheuristic methods for a real-world examination timetabling problem (Q6136080) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)
