Pages that link to "Item:Q632649"

The following pages link to Exact and heuristic algorithms for the interval data robust assignment problem (Q632649):

Displaying 12 items.

• On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
• A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
• Robust approach to restricted items selection problem (Q828685) (← links)
• Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← 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)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← 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)