Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

From MaRDI portal
Revision as of 20:58, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3466782

DOI10.1287/IJOC.2014.0632zbMath1329.90119DBLPjournals/informs/FuriniIMY15OpenAlexW2142448022WikidataQ57659049 ScholiaQ57659049MaRDI QIDQ3466782

Manuel Iori, Silvano Martello, Fabio Furini, Mutsunori Yagiura

Publication date: 25 January 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2014.0632




Related Items (18)

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret CriterionKnapsack problems -- an overview of recent advances. I: Single knapsack problemsA linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costsThe robust (minmax regret) assembly line worker assignment and balancing problemRobust min-max regret covering problemsAn Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret ObjectivesSolution techniques for bi-level knapsack problemsComplexity results for common due date scheduling problems with interval data and minmax regret criterionCombinatorial optimization problems with balanced regretAn exact approach for the bilevel knapsack problem with interdiction constraints and extensionsFix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertaintyA branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problemFormulation and algorithms for the robust maximal covering location problemA dynamic reformulation heuristic for generalized interdiction problemsA branch-and-cut algorithm for the edge interdiction clique problemRobust min-max regret scheduling to minimize the weighted number of late jobs with interval processing timesRobust Postdonation Blood Screening Under Prevalence Rate UncertaintyOn the exact separation of cover inequalities of maximum-depth


Uses Software



Cites Work




This page was built for publication: Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem