A column generation approach to capacitated \(p\)-median problems

DOI10.1016/S0305-0548(03)00039-XzbMath1048.90132OpenAlexW2086683901MaRDI QIDQ1433151

Luiz Antonio Nogueira Lorena, Edson Luiz França Senne

Publication date: 15 June 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00039-x

zbMATH Keywords

Column generation Location problems Capacitated \(p\)-median problems Lagrangean/surrogate relaxation

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource, Capacitated \(p\)-center problem with failure foresight, An implementation of exact knapsack separation, Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent, A Benders decomposition based framework for solving cable trench problems, Large-scale pickup and delivery work area design, A multi-period shelter location-allocation model with evacuation orders for flood disasters, A branch-and-price algorithm for the capacitated facility location problem, A Lagrangian heuristic algorithm for a public healthcare facility location problem, Solving the \(p\)-median problem on regular and lattice networks, A scatter search-based heuristic to locate capacitated transshipment points, A matheuristic for large-scale capacitated clustering, An efficient heuristic algorithm for the capacitated \(p\)-median problem, The most probable allocation solution for the p-median problem, Discrete facility location in machine learning, Primal and dual bounds for the vertex \(p\)-median problem with balance constraints, The exam location problem: mathematical formulations and variants, An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning, An effective VNS for the capacitated \(p\)-median problem, An iterated local search for the budget constrained generalized maximal covering location problem, The capacitated mobile facility location problem, Using dual feasible functions to construct fast lower bounds for routing and location problems, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, A reactive GRASP with path relinking for capacitated clustering, A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, A branch-and-price approach to \(p\)-median location problems, Validating vehicle routing zone construction using Monte Carlo simulation, A branch and bound algorithm for determining locations of long-term care facilities, An exact algorithm for the capacitated vertex \(p\)-center problem, Solving a class of stochastic mixed-integer programs with branch and price, Model-based capacitated clustering with posterior regularization, Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem, A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff, An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, Optimising shelter location and evacuation routing operations: the critical issues, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Large-scale local search heuristics for the capacitated vertexp-center problem, Clustering search algorithm for the capacitated centered clustering problem, The support unit location problem to road traffic surveys with multi-stages, Lagrangean duals and exact solution to the capacitated \(p\)-center problem, Matheuristics for the capacitated p‐median problem, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, An approximation algorithm for the facility location problem with lexicographic minimax objective, The capacitated centred clustering problem, Metaheuristic applications on discrete facility location problems: a survey

Uses Software

Cites Work