R. Ahuja, J. Orlin  Home/Search
Context Related
| di.unipi.it/pub/techrep...TR0211.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~scut/paperscheda (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. (Update)
Similar documents based on text: More All
1.2: The Facility Location Problem with Concave Cost Functions - Hajiaghayi, Mahdian.. (2002) (Correct)
1.1: The Facility Location Problem with General Cost Functions - Hajiaghayi, Mahdian.. (2002) (Correct)
1.1: Analysis of a Local Search Heuristic for Facility.. - Korupolu, Plaxton.. (1998) (Correct)
BibTeX entry: (Update)
R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutella, A multiexchange heuristic for the single source capacitated facility location problem, TR 0211, Dipartimento di Informatica, University of Pisa, 2002 (submitted to Management Science). http://citeseer.ist.psu.edu/ahuja02multiexchange.html More
@misc{ ahuja02multiexchange,
author = "R. Ahuja and J. Orlin and S. Pallottino and M. Scaparra and M. Scutell",
title = "A multiexchange heuristic for the single source capacitated facility location
problem",
text = "R.K. Ahuja, J.B. Orlin, S. Pallottino, M.P. Scaparra, and M.G. Scutella,
A multiexchange heuristic for the single source capacitated facility location
problem, TR 0211, Dipartimento di Informatica, University of Pisa, 2002
(submitted to Management Science).",
year = "2002",
url = "citeseer.ist.psu.edu/ahuja02multiexchange.html" }
Citations (may not include all citations):31 A dual-based procedure for uncapacitated facility location (context) - Erlenkotter - 1978
15 Approximation algorithms for knapsack problems with cardinal.. - Caprara, Kellerer et al. - 2000
14 Cyclic transfer algorithms for multi-vehicle routing and sch.. (context) - Thompson, Psaraftis - 1993
5 A lagrangian heuristic for the capacitated plant location pr.. (context) - Sridharan - 1991
5 Operations Research Center (context) - Thompson, Orlin et al. - 1989
5 An exact algorithm for the capacitated facility location pro.. (context) - Holmberg, Ronnqvist et al. - 1999
4 A multi-exchange neighborhood for minimum makespan machine s.. - Frangioni, Necciari et al. - 2000
4 A class of greedy algorithms for the generalized assignment .. (context) - Romeijn, Morales - 2000
4 Computational results from a new Lagrangean relaxation algor.. (context) - Barcelo, Fernandez et al. - 1991
4 Comparing new heuristics for the pure integer capacitated pl.. (context) - Delmaire, Diaz et al. - 1997
3 A Lagrangean relaxation heuristic for capacitated facility l.. (context) - Klincewicz, Luss - 1986
3 A repeated matching heuristic for the single-source capacita.. (context) - Ronnqvist, Tragantalerngsak et al. - 1999
3 Lagrangian heuristics for location problems (context) - Beasley - 1993
3 A heuristic Lagrangean algorithm for the capacitated plant l.. (context) - Barcelo, Casanova - 1984
2 capacitated plant location problems (context) - Hindi, nkosz et al. - 1999
[Article contains additional citations not shown here]
Documents on the same site (http://www.di.unipi.it/~scut/paperscheda.html): More
Minimum Time and Minimum Cost Path Problems in Street Networks .. - Ahuja, Orlin (Correct)
Reoptimization Algorithms for Minimum-Time Path.. - Chabini, Glenn.. (Correct)
Large Scale Local Search Heuristics for the - Capacitated Vertex Center (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC