Pages that link to "Item:Q697563"
From MaRDI portal
The following pages link to A survey of very large-scale neighborhood search techniques (Q697563):
Displaying 50 items.
- Repairing high school timetables with polymorphic ejection chains (Q284402) (← links)
- A decision support approach to automatic timetabling in higher education institutions (Q310350) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty (Q322445) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem (Q336415) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- Constraint-based large neighborhood search for machine reassignment. A solution approach to the ROADEF/EURO challenge 2012 (Q338855) (← links)
- Split-merge: using exponential neighborhood search for scheduling a batching machine (Q342048) (← links)
- The load-balanced multi-dimensional bin-packing problem (Q342477) (← links)
- Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem (Q342548) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- Timetable construction: the algorithms and complexity perspective (Q475200) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Valuated matroid-based algorithm for submodular welfare problem (Q492835) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Planning wireless networks by shortest path (Q538307) (← links)
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Scheduling technicians and tasks in a telecommunications company (Q707696) (← links)
- Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems (Q726205) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- Simultaneous product and service delivery vehicle routing problem with time windows and order release dates (Q822105) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- Two local search approaches for solving real-life car sequencing problems (Q932212) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- A large neighborhood search heuristic for the longest common subsequence problem (Q953288) (← links)
- An interactive solution approach for a bi-objective semi-desirable location problem (Q960111) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- A novel iterative shape from focus algorithm based on combinatorial optimization (Q991937) (← links)
- Long-term staffing based on qualification profiles (Q1006561) (← links)
- Hybridization of very large neighborhood search for ready-mixed concrete delivery problems (Q1038296) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
