Pages that link to "Item:Q1109683"
From MaRDI portal
The following pages link to A new dominance procedure for combinatorial optimization problems (Q1109683):
Displayed 4 items.
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach (Q1926737) (← links)