A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric

DOI10.1016/j.endm.2018.06.028zbMath1408.90299OpenAlexW2882977734WikidataQ129518485 ScholiaQ129518485MaRDI QIDQ1792086

Moisés Rodríguez-Madrena, Justo Puerto

Publication date: 11 October 2018

Full work available at URL: https://idus.us.es/handle//11441/80198

zbMATH Keywords

finite dominating setsnetwork optimizationmetric optimization problems with obstacles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On the structure of the solution set for the single facility location problem with average distances
• An efficient algorithm for facility location in the presence of forbidden regions
• Location Theory
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric

This page was built for publication: A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric