Pages that link to "Item:Q5959081"
From MaRDI portal
The following pages link to A new method for solving capacitated location problems based on a set partitioning approach (Q5959081):
Displayed 7 items.
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- A review of congestion models in the location of facilities with immobile servers (Q859675) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
- A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)