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 21 items.
- An implementation of exact knapsack separation (Q330511) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← 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 computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- A cutting plane method for knapsack polytope (Q2391714) (← 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)
- A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
- Locating Satellite Yards in Forestry Operations (Q6160212) (← links)
- Two‐stage stochastic one‐to‐many driver matching for ridesharing (Q6180029) (← links)