Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

A multi-exchange local search algorithm for the capacitated facility location problem - (Extended abstract)

Tools
- Tools
+ Tools

UNSPECIFIED (2004) A multi-exchange local search algorithm for the capacitated facility location problem - (Extended abstract). In: 10th International Integer Programming and Combinatorial Optimization Conference, JUN 07-11, 2004, New York, NY.

Full text not available from this repository.

Abstract

We present a multi-exchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3 + 2root2 - epsilon and 3 + 2 root2 + epsilon for any given constant epsilon > 0. Previously known best approximation ratio for the CFLP is 7.88, due to Mahdian and Pal (2003), based on the operations proposed by Pal, Tardos and Wexler (2001). Our upper bound 3 + 2root2 + epsilon also matches the best known ratio, obtained by Chudak and Williamson (1999), for the CFLP with uniform capacities. In order to obtain the tight bound of our new algorithm, we make interesting use of the notion of exchange graph of Pal et al. and techniques from the area of parallel machine scheduling.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name: LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title: INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-22113-1
ISSN: 0302-9743
Editor: Bienstock, D and Nemhauser, G
Date: 2004
Volume: 3064
Number of Pages: 15
Page Range: pp. 219-233
Publication Status: Published
Title of Event: 10th International Integer Programming and Combinatorial Optimization Conference
Location of Event: New York, NY
Date(s) of Event: JUN 07-11, 2004
URI: http://wrap.warwick.ac.uk/id/eprint/8294

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us