A branch-and-price algorithm for the capacitatedp-median problem-Reference-Cited by-同舟云学术

A branch-and-price algorithm for the capacitatedp-median problem

Published:2005 Issue:3 Volume:45 Page:125-142
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Ceselli Alberto,Righini Giovanni

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference28 articles.

1. A new method for solving capacitated location problems based on a set partitioning approach

2. A note on solving large p-median problems

3. Algoritmi branch and bound e branch and price per il problema delle p-mediane con capacità (in Italian), Dipartimento di Technologie dell'Informazione, Università degli Studi di Milano, Master degree thesis 2002.

4. A tree search algorithm for the p-median problem

5. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

Cited by 59 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Regionalization of primary health care units: An iterated greedy algorithm for large-scale instances;Expert Systems with Applications;2024-09

2. Recovering Dantzig–Wolfe Bounds by Cutting Planes;Operations Research;2024-01-03

3. Large Neighborhood Search for the Capacitated P-Median Problem;Lecture Notes in Computer Science;2024

4. Discrete-continuous model for facility location problem with capacity-cost relation constraints;Computers & Industrial Engineering;2023-11

5. Gradual cooperative coverage models for optimally locating rain gauges on an urban transportation network;Expert Systems with Applications;2023-08