Pages that link to "Item:Q5289663"
From MaRDI portal
The following pages link to Adapting Branch-and-Bound for Real-World Scheduling Problems (Q5289663):
Displayed 3 items.
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
- Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners (Q6080629) (← links)