Discrete optimization with interval data. Minmax regret and fuzzy approach
From MaRDI portal
Publication:924859
DOI10.1007/978-3-540-78484-5zbMath1154.90017OpenAlexW4231981185MaRDI QIDQ924859
Publication date: 29 May 2008
Published in: Studies in Fuzziness and Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78484-5
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Theory of fuzzy sets, etc. (03E72)
Related Items (38)
Robust approach to restricted items selection problem ⋮ Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ A minimum expected regret model for the shortest path problem with solution-dependent probability distributions ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ Minmax regret combinatorial optimization problems with investments ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ The robust (minmax regret) assembly line worker assignment and balancing problem ⋮ Robust Optimization by Fuzzy Linear Programming ⋮ The robust set covering problem with interval data ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ On recoverable and two-stage robust selection problems with budgeted uncertainty ⋮ Fast minimum float computation in activity networks under interval uncertainty ⋮ Complexity results for common due date scheduling problems with interval data and minmax regret criterion ⋮ Mathematical optimization models for reallocating and sharing health equipment in pandemic situations ⋮ Gradualness, uncertainty and bipolarity: making sense of fuzzy sets ⋮ The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Optimization problems with evidential linear objective ⋮ Exact and heuristic algorithms for the interval data robust assignment problem ⋮ Algorithms and complexity analysis for robust single-machine scheduling problems ⋮ Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ Robust multicovers with budgeted uncertainty ⋮ A minmax regret linear regression model under uncertainty in the dependent variable ⋮ Complexity of the robust weighted independent set problems on interval graphs ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ A branch-and-cut algorithm for the edge interdiction clique problem ⋮ Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion ⋮ Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times ⋮ A note on robustness tolerances for combinatorial optimization problems ⋮ On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs
This page was built for publication: Discrete optimization with interval data. Minmax regret and fuzzy approach
