Pages that link to "Item:Q2286876"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for an assembly routing problem (Q2286876):
Displaying 3 items.
- A mathematical programming-based heuristic for the production routing problem with transshipments (Q2664374) (← links)
- A branch-and-cut approach for a generic multiple-product, assembly-system design problem (Q2890406) (← links)
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing (Q5137442) (← links)