Pages that link to "Item:Q1417775"

The following pages link to On dual based lower bounds for the sequential ordering problem with precedences and due dates (Q1417775):

Displaying 7 items.

• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• Local search procedures for improving feasible solutions to the sequential ordering problem (Q1309885) (← links)
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
• A mixed-integer model for solving ordering problems with side constraints (Q1357786) (← links)
• On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)