Pages that link to "Item:Q367647"

The following pages link to The robust set covering problem with interval data (Q367647):

Displaying 10 items.

• On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
• Sufficient optimality conditions and duality theory for interval optimization problem (Q338934) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
• A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
• A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
• Formulation and algorithms for the robust maximal covering location problem (Q1742214) (← links)
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)