Choosing robust solutions in discrete optimization problems with fuzzy costs
type: Item
instance of: scholarly article
title: Choosing robust solutions in discrete optimization problems with fuzzy costs
zbMATH Open document ID: 1173.90596
author: Adam Kasperski
author: Michał Kulej
published in: Fuzzy Sets and Systems
publication date: 2009-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C70
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5634401
zbMATH Keywords: discrete optimization
zbMATH Keywords: robust optimization
zbMATH Keywords: fuzzy interval
zbMATH Keywords: possibility theory
zbMATH Keywords: minmax
zbMATH Keywords: minmax regret
describes a project that uses: GLPK
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.fss.2008.09.001
OpenAlex ID: W2003780271
cites work: Q3056948
cites work: Algorithms and Computation
cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Interval data minmax regret network optimization problems
cites work: Robust optimization - a comprehensive survey
cites work: An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
cites work: Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
cites work: Fuzzy sets and systems. Theory and applications
cites work: Q4039980
cites work: Q3214706
cites work: Fuzzy boolean programming problems with fuzzy costs: A general study
cites work: On Possibilistic/Fuzzy Optimization
cites work: Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem
cites work: Possible and necessary optimality tests in possibilistic linear programming problems
cites work: Minimax regret solution to linear programming problems with an interval objective function
cites work: Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test
cites work: Robust optimization under softness in a fuzzy linear programming problem
cites work: Possibilistic linear programming with fuzzy if-then rule coefficients
cites work: The robust spanning tree problem with interval data
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
cites work: Robust discrete optimization and its applications
cites work: Q4130999
cites work: Q4217266
cites work: On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
cites work: On the robust shortest path problem.
DOI: 10.1016/J.FSS.2008.09.001
description: scientific article; zbMATH DE number 5634401