scientific article; zbMATH DE number 849075

zbMath0840.90097MaRDI QIDQ4867320

Pierre Hansen, I. Douglas Moon

Publication date: 28 February 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quadratic knapsacktree networkobnoxious facility\(p\)-maxisum dispersion problem

Mathematics Subject Classification ID

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

Related Items (9)

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks ⋮ Analytical models for locating undesirable facilities ⋮ Subset selection from large datasets for kriging modeling ⋮ On linearization techniques for budget-constrained binary quadratic programming problems ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ Good solutions to discrete noxious location problems via metaheuristics ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ The equitable dispersion problem ⋮ The discrete p-maxian location problem

This page was built for publication: