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):

Displaying 17 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• Exact solution of the robust knapsack problem (Q336592) (← links)
• A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
• Speeding up column generation for robust wireless network planning (Q743642) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
• A branch and price approach for the robust bandwidth packing problem with queuing delays (Q2070728) (← links)
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
• Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
• Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
• Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
• Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← links)
• Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
• A new sequential lifting of robust cover inequalities (Q6492454) (← links)