Pages that link to "Item:Q1683123"
From MaRDI portal
The following pages link to Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123):
Displaying 5 items.
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)