Pages that link to "Item:Q932177"

The following pages link to An effective VNS for the capacitated \(p\)-median problem (Q932177):

Displaying 24 items.

• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
• Variable neighborhood search for location routing (Q339539) (← links)
• An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147) (← 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)
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
• A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• The most probable allocation solution for the p-median problem (Q3389552) (← 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)
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
• A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)