Pages that link to "Item:Q991475"

The following pages link to A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475):

Displaying 10 items.

• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• Minmax regret combinatorial optimization problems with investments (Q1652341) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines (Q2448222) (← links)
• The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)