Pages that link to "Item:Q322625"
From MaRDI portal
The following pages link to Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625):
Displaying 10 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Strong cuts from compatibility relations for the dial-a-ride problem (Q2065792) (← links)
- Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
- Pickup and delivery problem with incompatibility constraints (Q2333153) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)