A column generation approach to capacitated p-median problems
From MaRDI portal
Publication:1433151
DOI10.1016/S0305-0548(03)00039-XzbMATH Open1048.90132OpenAlexW2086683901MaRDI QIDQ1433151FDOQ1433151
Authors: Luiz Antonio Nogueira Lorena, E. L. F. 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
Recommendations
- A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Two exact algorithms for the capacitated \(p\)-median problem
- Matheuristics for the capacitated p-Median problem
- A genetic algorithm for solving a capacitated \(p\)-median problem
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- An effective VNS for the capacitated \(p\)-median problem
- A column generation approach for the maximal covering location problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- A bionomic approach to the capacitated \(p\)-median problem
- Title not available (Why is that?)
- Stabilized column generation
- Branch-and-price: Column generation for solving huge integer programs
- The Cutting-Plane Method for Solving Convex Programs
- Location-Allocation Problems
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Flight Attendant Rostering for Short-Haul Airline Operations
- Decomposition Principle for Linear Programs
- The traveling salesman. Computational solutions for RSP applications
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A Location Based Heuristic for General Routing Problems
- Solving capacitated clustering problems
- Solving binary cutting stock problems by column generation and branch- and-bound
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- Title not available (Why is that?)
- Lagrangean/surrogate relaxation for generalized assignment problems
- A surrogate heuristic for set covering problems
- Relaxation heuristics for a generalized assignment problem
- On improvements to the analytic center cutting plane method
- A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
- Title not available (Why is that?)
Cited In (58)
- Discrete facility location in machine learning
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- The exam location problem: mathematical formulations and variants
- A column-generation-based algorithm for a resource-constrained project scheduling problem with a fractional shared resource
- Metaheuristic applications on discrete facility location problems: a survey
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Matheuristics for the capacitated p‐median problem
- Optimising shelter location and evacuation routing operations: the critical issues
- Clustering search algorithm for the capacitated centered clustering problem
- The capacitated mobile facility location problem
- The capacitated centred clustering problem
- A scatter search-based heuristic to locate capacitated transshipment points
- The most probable allocation solution for the p-median problem
- A Benders decomposition based framework for solving cable trench problems
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Model-based capacitated clustering with posterior regularization
- Solving a class of stochastic mixed-integer programs with branch and price
- Solving the \(p\)-median problem on regular and lattice networks
- A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
- STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES
- A reactive GRASP with path relinking for capacitated clustering
- Capacitated \(p\)-center problem with failure foresight
- Large-scale pickup and delivery work area design
- A branch-and-price algorithm for the capacitated facility location problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- The support unit location problem to road traffic surveys with multi-stages
- An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem
- 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
- Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
- An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing
- 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
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- A branch and bound algorithm for determining locations of long-term care facilities
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- A column generation approach for the maximal covering location problem
- A matheuristic for large-scale capacitated clustering
- A multi-period shelter location-allocation model with evacuation orders for flood disasters
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- An iterated local search for the budget constrained generalized maximal covering location problem
- An effective VNS for the capacitated \(p\)-median problem
- An approximation algorithm for the facility location problem with lexicographic minimax objective
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Validating vehicle routing zone construction using Monte Carlo simulation
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Two exact algorithms for the capacitated \(p\)-median problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- A branch-and-price approach to \(p\)-median location problems
- An exact algorithm for the capacitated vertex \(p\)-center problem
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
Uses Software
This page was built for publication: A column generation approach to capacitated \(p\)-median problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433151)
