Pages that link to "Item:Q3466782"

The following pages link to Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782):

Displaying 18 items.

• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem (Q1725600) (← links)
• Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Robust min-max regret covering problems (Q2162527) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times (Q2288971) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• Combinatorial optimization problems with balanced regret (Q2685694) (← links)
• Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty (Q4969303) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
• Solution techniques for bi-level knapsack problems (Q6047889) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)