Pages that link to "Item:Q1273663"
From MaRDI portal
The following pages link to A bionomic approach to the capacitated \(p\)-median problem (Q1273663):
Displaying 20 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
- Model-based capacitated clustering with posterior regularization (Q724144) (← links)
- Scatter search and bionomic algorithms for the aircraft landing problem (Q817534) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Budget constrained location problem with opening and closing of facilities. (Q1413833) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← 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)
- A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
- A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
- Ant colony optimization for finding medians of weighted graphs (Q4908024) (← links)
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)