Pages that link to "Item:Q813974"

The following pages link to Complexity of the min-max and min-max regret assignment problems (Q813974):

Displayed 28 items.

• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) ‎ (← links)
• New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) ‎ (← links)
• Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) ‎ (← links)
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights (Q433509) ‎ (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) ‎ (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) ‎ (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) ‎ (← links)
• Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) ‎ (← links)
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis) (Q882651) ‎ (← links)
• Complexity of the min-max (regret) versions of min cut problems (Q924631) ‎ (← links)
• On the approximability of minmax (regret) network optimization problems (Q976089) ‎ (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) ‎ (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) ‎ (← links)
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) ‎ (← links)
• Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios (Q1634058) ‎ (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) ‎ (← links)
• Minmax regret combinatorial optimization problems with investments (Q1652341) ‎ (← links)
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) ‎ (← links)
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) ‎ (← links)
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion (Q1790193) ‎ (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) ‎ (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) ‎ (← links)
• On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data (Q2457271) ‎ (← links)
• Routing Optimization Under Uncertainty (Q2806069) ‎ (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) ‎ (← links)
• The Complexity of Bottleneck Labeled Graph Problems (Q3508579) ‎ (← links)
• AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM (Q4649882) ‎ (← links)
• The complexity of bottleneck labeled graph problems (Q5961969) ‎ (← links)