Pages that link to "Item:Q336592"

The following pages link to Exact solution of the robust knapsack problem (Q336592):

Displaying 27 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)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Lifting of probabilistic cover inequalities (Q1728321) (← links)
• The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach (Q1738828) (← links)
• The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
• Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
• Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
• Public R\&D project portfolio selection problem with cancellations (Q2014587) (← links)
• A branch and price approach for the robust bandwidth packing problem with queuing delays (Q2070728) (← links)
• The polynomial robust knapsack problem (Q2103045) (← links)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
• A Dynamic Programming Approach for a Class of Robust Optimization Problems (Q2817842) (← links)
• Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
• Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
• A new sequential lifting of robust cover inequalities (Q6492454) (← links)