Pages that link to "Item:Q1730629"
From MaRDI portal
The following pages link to Solving the capacitated clustering problem with variable neighborhood search (Q1730629):
Displaying 12 items.
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Solving capacitated clustering problems (Q799059) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- Joint decision-making for divisional \textit{seru} scheduling and worker assignment considering process sequence constraints (Q6588523) (← links)
