Pages that link to "Item:Q1109683"
From MaRDI portal
The following pages link to A new dominance procedure for combinatorial optimization problems (Q1109683):
Displaying 9 items.
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Binary decision diagrams for generating and storing non-dominated project portfolios with interval-valued project scores (Q1753430) (← 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)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Compact representation of near-optimal integer programming solutions (Q2191768) (← links)
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)