The following pages link to (Q4031974):
Displaying 20 items.
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- Structural analysis of local search heuristics in combinatorial optimization (Q1095797) (← links)
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- General local search methods (Q1268283) (← links)
- Heuristic concentration: Two stage solution construction (Q1278583) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Heuristic concentration and tabu search: A head to head comparison (Q1291635) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) (← links)
- Heuristic algorithms for the two-stage hybrid flowshop problem (Q1371955) (← links)
- Simulated annealing for complex portfolio selection problems. (Q1406489) (← links)
- A robust simulated annealing based examination timetabling system. (Q1406667) (← links)
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works (Q1603329) (← links)
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem (Q1917905) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Towards an efficient resolution of printing problems (Q2339840) (← links)
- (Q3077271) (← links)
- Cylinder packing by simulated annealing (Q5189102) (← links)
- Comparing descent heuristics and metaheuristics for the vehicle routing problem (Q5926600) (← links)
