Pages that link to "Item:Q385459"

The following pages link to An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459):

Displaying 17 items.

• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• A bionomic approach to the capacitated \(p\)-median problem (Q1273663) (← links)
• A dynamic programming heuristic for the \(P\)-median problem (Q1278985) (← links)
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
• Two exact algorithms for the capacitated \(p\)-median problem (Q1421050) (← links)
• A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
• Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems (Q3161792) (← links)
• Efficient Algorithms for the Capacitated 1-Median Problem (Q4024313) (← links)
• A new heuristic approach for the P-median problem (Q4359928) (← links)
• Discrete equal-capacityp-median problem (Q4949164) (← links)
• An Algorithm for Solving Capacitated Multicommodity <i>p</i>-median Transportation Problems (Q5287230) (← links)
• (Q5696416) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)