Dominance rules for the optimal placement of a finite-size facility in an existing layout

DOI10.1016/j.cor.2014.05.015zbMath1348.90386OpenAlexW2042587593MaRDI QIDQ337129

Rakesh Nagi, Suryaansh Makked, Ketan Date

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.015

zbMATH Keywords

lower boundfacility locationdominancefinite-size facilityinput/output pointrectilinear distance

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items

Optimal facility layout and material handling network design ⋮ Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A note on center problems with forbidden polyhedra
• Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Location of regional facilities
• Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
• Finding minimum rectilinear distance paths in the presence of barriers
• Location of facilities with rectangular distances among point and area destinations
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph