Pages that link to "Item:Q337176"
From MaRDI portal
The following pages link to A fix-and-optimize heuristic for the high school timetabling problem (Q337176):
Displayed 25 items.
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- Developing compact course timetables with optimized student flows (Q322740) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- maxSAT-based large neighborhood search for high school timetabling (Q1652069) (← links)
- Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages (Q1730713) (← links)
- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure (Q1730745) (← links)
- A column generation approach to high school timetabling modeled as a multicommodity flow problem (Q1752250) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- The multiphase course timetabling problem (Q2116932) (← links)
- A dynamic Thompson sampling hyper-heuristic framework for learning activity planning in personalized learning (Q2184164) (← links)
- Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- Modeling interdependencies in infrastructure systems using multi-layered network flows (Q2297565) (← links)
- Modeling high school timetabling with bitvectors (Q2398422) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- High quality timetables for Italian schools (Q2676380) (← links)
- Relax-fix-optimize heuristics for time-relaxed sports timetabling (Q5889201) (← links)
- A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty (Q6079879) (← links)
- Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach (Q6109338) (← links)
- MIP heuristics for a resource constrained project scheduling problem with workload stability constraints (Q6134060) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)
- Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem (Q6189811) (← links)
- The coupled task scheduling problem: an improved mathematical program and a new solution algorithm (Q6195035) (← links)