A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Solving binary cutting stock problems by column generation and branch-and-bound
Computational Optimization and Applications
On Improvements to the Analytic Center Cutting Plane Method
Computational Optimization and Applications
Discrete Mathematics
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
A column generation approach to capacitated p-median problems
Computers and Operations Research
Technical Section: Automated generation and visualization of picture-logic puzzles
Computers and Graphics
A decomposition approach for the probabilistic maximal covering location-allocation problem
Computers and Operations Research
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems
INFORMS Journal on Computing
An aggregation heuristic for large scale p-median problem
Computers and Operations Research
Relax-and-fix decomposition technique for solving large scale grid-based location problems
Computers and Industrial Engineering
Position Unmanned Aerial Vehicles in the Mobile Ad Hoc Network
Journal of Intelligent and Robotic Systems
Tactical fixed job scheduling with spread-time constraints
Computers and Operations Research
| Hi-index | 0.01 |
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances.