The following pages link to (Q3437242):
Displayed 13 items.
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- MILP-based heuristics for the design of rural community electrification projects (Q342343) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- Applying the corridor method to a blocks relocation problem (Q657049) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- Generalized local branching heuristics and the capacitated ring tree problem (Q1744240) (← links)
- Integer programming models for the pre-marshalling problem (Q1755240) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks (Q5246822) (← links)