Pages that link to "Item:Q799059"

The following pages link to Solving capacitated clustering problems (Q799059):

Displaying 39 items.

• Space exploration via proximity search (Q312150) (← links)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• Assignment of tools to machines in a flexible manufacturing system (Q1130034) (← links)
• Order selection on a single machine with high set-up costs (Q1309884) (← links)
• Application of facility location modeling constructs to vendor selection problems (Q1333485) (← links)
• Clustering on trees (Q1392041) (← links)
• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• Clustering of objects and attributes for manufacturing and marketing applications (Q1572988) (← links)
• A mathematical programming approach to clusterwise regression model and its extensions (Q1610186) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• Constrained clustering via diagrams: a unified theory and its application to electoral district design (Q1695008) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← 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 heuristic approach to the overnight security service problem (Q1868811) (← links)
• A distributed geographic information system for the daily car pooling problem (Q1886004) (← links)
• The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
• A hybrid heuristic for the maximum dispersion problem (Q2028755) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
• A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
• The capacitated centred clustering problem (Q2581607) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
• Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
• Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
• A spanning tree heuristic for regional clustering (Q4843881) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• A Binary Variable Model for Affinity Propagation (Q5323836) (← 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)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)