A branch-and-price approach to \(p\)-median location problems

DOI10.1016/j.cor.2003.11.024zbMath1071.90048OpenAlexW1969142790MaRDI QIDQ1764773

Luiz Antonio Nogueira Lorena, Marcos Antonio Pereira, Edson Luiz França Senne

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.024

zbMATH Keywords

\(p\)-medianColumn generationLagrangean/surrogate relaxationBranch and price

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items

Balancing staffing and switching costs in a service center with flexible servers, Tactical fixed job scheduling with spread-time constraints, A branch-and-price algorithm for the capacitated facility location problem, Computational study of large-scale \(p\)-median problems, Solving the \(p\)-median problem on regular and lattice networks, Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A fast swap-based local search procedure for location problems, An aggregation heuristic for large scale p-median problem, A decomposition approach for the probabilistic maximal covering location-allocation problem, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A tree search algorithm for the p-median problem
• On improvements to the analytic center cutting plane method
• Stabilized column generation
• Solving binary cutting stock problems by column generation and branch- and-bound
• A column generation approach to capacitated \(p\)-median problems
• Lagrangean/surrogate relaxation for generalized assignment problems
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The B<scp>oxstep</scp> Method for Large-Scale Optimization
• Flight Attendant Rostering for Short-Haul Airline Operations
• A branch‐and‐price algorithm for the capacitated p‐median problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II