Pages that link to "Item:Q2892146"

The following pages link to Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146):

Displayed 4 items.

• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) ‎ (← links)
• Recoverable robust knapsacks: the discrete scenario case (Q691430) ‎ (← links)
• Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) ‎ (← links)
• Robust network design: Formulations, valid inequalities, and computations (Q5326784) ‎ (← links)