Locating flow-intercepting facilities: New approaches and results

DOI10.1007/BF02031943zbMath0839.90069MaRDI QIDQ1908283

Dmitry Krass, Chen Wei Xu, Oded Berman

Publication date: 23 June 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

nonlinear integer programmingworst-case bounddouble-counting modelno-double-counting model

Mathematics Subject Classification ID

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

Related Items (4)

Flow intercepting facility location: Problems, models and heuristics ⋮ Effects of multipurpose shopping trips on retail store location in a duopoly ⋮ Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice ⋮ Optimization of stochastic virus detection in contact networks

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal Location of Discretionary Service Facilities
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
• Locating Discretionary Service Facilities Based on Probabilistic Customer Flows

This page was built for publication: Locating flow-intercepting facilities: New approaches and results