Capacitated Location Problems on a Line

DOI10.1287/TRSC.30.1.75zbMATH Open0851.90075OpenAlexW2060883269MaRDI QIDQ4889778FDOQ4889778

Authors: P. Mirchandani, Rajeev Kohli, Arie Tamir 

Publication date: 6 August 1996

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.1.75

Recommendations

• The Capacitated p-facility Location Problem on the Real Line
• Location and sizing of facilities on a line
• Structured \(p\)-facility location problems on the line solvable in polynomial time
• Capacitated location-allocation problems on a line
• Solving the plant location problem on a line by linear programming

zbMATH Keywords

capacitated facility locationstraight linepolynomial-time dynamic programming

Mathematics Subject Classification ID

Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cited In (10)

• Construction Line Algorithms for the Connection Location-Allocation Problem
• The Capacitated p-facility Location Problem on the Real Line
• Line Segment Facility Location in Weighted Subdivisions
• The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
• Title not available (Why is that?)
• The impact of cost uncertainty on the location of a distribution center
• A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand
• Capacitated location-allocation problems on a line
• Location and sizing of facilities on a line
• Ant colony system solving capacitated location-allocation problems on a line

This page was built for publication: Capacitated Location Problems on a Line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889778)