Pages that link to "Item:Q1881565"

The following pages link to An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion (Q1881565):

Displaying 23 items.

• On discrete optimization with ordering (Q367635) (← links)
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
• Robust approach to restricted items selection problem (Q828685) (← links)
• On combinatorial optimization problems on matroids with uncertain weights (Q856278) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Restricted robust uniform matroid maximization under interval uncertainty (Q879971) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
• Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
• Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
• Robust recoverable and two-stage selection problems (Q2410249) (← 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)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)