Pages that link to "Item:Q1433151"

The following pages link to A column generation approach to capacitated \(p\)-median problems (Q1433151):

Displaying 50 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• 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)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• A multi-period shelter location-allocation model with evacuation orders for flood disasters (Q339935) (← links)
• A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
• An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
• An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
• A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← 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)
• Two exact algorithms for the capacitated \(p\)-median problem (Q1421050) (← links)
• A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem (Q1761153) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
• Optimising shelter location and evacuation routing operations: the critical issues (Q2312324) (← links)
• An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• The capacitated centred clustering problem (Q2581607) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem (Q2806896) (← links)
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938) (← 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)
• Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource (Q5059351) (← 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)