Pages that link to "Item:Q1044085"

The following pages link to Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085):

Displaying 7 items.

• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
• Criticality analysis of activity networks under interval uncertainty (Q633555) (← links)
• Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
• The binary knapsack problem with qualitative levels (Q2029032) (← links)
• Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)