Pages that link to "Item:Q1698884"
From MaRDI portal
The following pages link to The late acceptance hill-climbing heuristic (Q1698884):
Displaying 22 items.
- Late acceptance hill-climbing for high school timetabling (Q309068) (← links)
- A step counting hill climbing algorithm applied to university examination timetabling (Q309075) (← links)
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling (Q320651) (← links)
- Simulated annealing for the machine reassignment problem (Q338857) (← links)
- Large-scale vehicle routing problems: quantum annealing, tunings and results (Q1652398) (← links)
- Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
- The late acceptance hill-climbing heuristic (Q1698884) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems (Q1734832) (← links)
- The berth allocation problem in terminals with irregular layouts (Q1991240) (← links)
- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds (Q2027659) (← links)
- Scheduling for multi-robot routing with blocking and enabling constraints (Q2059084) (← links)
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- Multi-machine energy-aware scheduling (Q2397770) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- The vessel swap-body routing problem (Q2673585) (← links)
- Ride sharing with flexible participants: a metaheuristic approach for large‐scale problems (Q6070411) (← links)
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem (Q6070990) (← links)
- Expansion-based hill-climbing (Q6074953) (← links)
- Educational timetabling: problems, benchmarks, and state-of-the-art results (Q6167390) (← links)