Pages that link to "Item:Q4680415"

The following pages link to A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem (Q4680415):

Displaying 23 items.

• An implementation of exact knapsack separation (Q330511) (← links)
• 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 efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← 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)
• The capacitated mobile facility location problem (Q1737488) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• A cutting plane method for knapsack polytope (Q2391714) (← 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)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
• The most probable allocation solution for the p-median problem (Q3389552) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)