The following pages link to On the Robust Knapsack Problem (Q5408207):
Displaying 16 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- Robust combinatorial optimization with variable cost uncertainty (Q296586) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
