An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
From MaRDI portal
Publication:1881565
DOI10.1007/s10107-003-0474-7zbMath1070.90129OpenAlexW2032713519MaRDI QIDQ1881565
Publication date: 5 October 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0474-7
Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty, Robust approach to restricted items selection problem, On combinatorial optimization problems on matroids with uncertain weights, Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty, Recoverable robust representatives selection problems with discrete budgeted uncertainty, Minmax regret location--allocation problem on a network under uncertainty, On discrete optimization with ordering, Restricted robust uniform matroid maximization under interval uncertainty, Robust recoverable and two-stage selection problems, Minimax regret spanning arborescences under uncertain costs, Min-max and min-max (relative) regret approaches to representatives selection problem, Complexity results for common due date scheduling problems with interval data and minmax regret criterion, Combinatorial optimization problems with balanced regret, The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows, Minmax regret bottleneck problems with solution-induced interval uncertainty structure, Combinatorial two-stage minmax regret problems under interval uncertainty, Compromise solutions for robust combinatorial optimization with variable-sized uncertainty, Ordered weighted average optimization in multiobjective spanning tree problem, A randomized algorithm for the min-Max selecting items problem with uncertain weights, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Computing and minimizing the relative regret in combinatorial optimization with interval data, Choosing robust solutions in discrete optimization problems with fuzzy costs, Improved polynomial algorithms for robust bottleneck problems with interval data
