The following pages link to (Q4452900):
Displaying 21 items.
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
- Enhanced iterated local search for the technician routing and scheduling problem (Q6068708) (← links)
- Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times (Q6070133) (← links)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining (Q6070880) (← links)
- Expansion-based hill-climbing (Q6074953) (← links)
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows (Q6079871) (← links)
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows (Q6079872) (← links)
- Local search algorithms for the composite retrieval problem (Q6079877) (← links)
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6080619) (← links)
- The strong network orientation problem (Q6082268) (← links)
- Local search approaches for the test laboratory scheduling problem with variable task grouping (Q6090219) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem (Q6146639) (← links)
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)
