Pages that link to "Item:Q2570156"

The following pages link to Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156):

Displaying 33 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
• An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• An evolutionary method for complex-process optimization (Q732898) (← links)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• Path relinking approach for multiple allocation hub maximal covering problem (Q971739) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
• Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
• Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
• An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
• A directional approach to gradual cover (Q2421326) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
• The most probable allocation solution for the p-median problem (Q3389552) (← links)
• Cooperative co‐evolutionary scatter search for satellite module layout design (Q4908059) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands (Q5131702) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• Evolutionary Computation in Combinatorial Optimization (Q5901734) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
• Robust facility location in reverse logistics (Q6115584) (← links)