A branch-and-price approach to \(p\)-median location problems
type: Item
instance of: scholarly article
title: A branch-and-price approach to \(p\)-median location problems
zbMATH Open document ID: 1071.90048
author: Luiz Antonio Nogueira Lorena
author: E. L. F. Senne
author: Marcos A. Pereira
published in: Computers \& Operations Research
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 2136915
zbMATH Keywords: \(p\)-median
zbMATH Keywords: Column generation
zbMATH Keywords: Lagrangean/surrogate relaxation
zbMATH Keywords: Branch and price
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2003.11.024
OpenAlex ID: W1969142790
cites work: Lagrangean/surrogate relaxation for generalized assignment problems
cites work: Decomposition Principle for Linear Programs
cites work: Flight Attendant Rostering for Short-Haul Airline Operations
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Q4054818
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: The B<scp>oxstep</scp> Method for Large-Scale Optimization
cites work: On improvements to the analytic center cutting plane method
cites work: Stabilized column generation
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A branch‐and‐price algorithm for the capacitated p‐median problem
cites work: A tree search algorithm for the p-median problem
DOI: 10.1016/J.COR.2003.11.024
Recommended article: A branch‐and‐price algorithm for the capacitated p‐median problem
Recommended article: A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
Recommended article: A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Recommended article: A branch-and-price algorithm for the capacitated facility location problem
Recommended article: Fast primal and dual heuristics for the \(p\)-median location problem
Recommended article: A branch-and-price approach for the continuous multifacility monotone ordered median problem
Recommended article: A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
Recommended article: A Branch Decomposition Algorithm for the p-Median Problem
Recommended article: A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
Recommended article: A branch-and-cut method for the obnoxious \(p\)-median problem
description: scientific article; zbMATH DE number 2136915