Pages that link to "Item:Q2481606"

The following pages link to A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606):

Displaying 17 items.

• An implementation of exact knapsack separation (Q330511) (← links)
• An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• A cutting plane method for knapsack polytope (Q2391714) (← links)
• A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)