skip to main | skip to sidebar

15-854B: Advanced Approximation Algorithms

http://www.cs.cmu.edu/~anupamg/adv-approx/
This material is based upon work supported by the National Science Foundation under Grant No. CCF-0747250. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).

Tuesday, January 29, 2008

Facility Location -- no joke

Facility Location is one of the theory problems studied most extensively in practice. It has obvious appeal in industry and is the subject of numerous books and optimization heuristics.

I especially like how the special case of the "Fermat-Weber problem" in the plane was already studied for its use in practice (minimizing industrial transportation cost) in 1909.
Posted by Ryan O'Donnell at 11:23 AM

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ▼  2008 (55)
    • ►  April (10)
    • ►  March (11)
    • ►  February (15)
    • ▼  January (19)
      • Homework 2
      • Example for Primal-Dual fixed
      • Facility Location -- no joke
      • Some more LP notes
      • Notes on Linear Programming
      • Nina and Avrim's problem
      • You too can post to the blog
      • Homework 1 problem 4b correction
      • Homework 1 Clarification
      • Scribes and Math Writing
      • Lecture 3: 1 vs. 3/4 + eps hardness for Max-Covera...
      • Prepare for Tuesday's class
      • LP integrality gaps for Min-Set-Cover
      • Lecture 1 and Lecture 2 scribe notes posted
      • Why decision and search are different for approxim...
      • Lecture 2: Algorithms and gaps for Set-Cover and C...
      • Max-Coverage vs. Min-Set-Cover
      • Min-R^2-TSP
      • Lecture 1: Definitions; greedy algorithm for Set-C...
  • ►  2007 (1)
    • ►  November (1)