Pages that link to "Item:Q1652219"

The following pages link to A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219):

Displaying 2 items.

• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)