scientific article; zbMATH DE number 849075

MaRDI QIDQ4867320zbMATH OpenFDO

Authors Pierre Hansen, I. Douglas Moon

Publication date 28 February 1996

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)

Recommendations

• scientific article; zbMATH DE number 1253046
• The discrete p-dispersion problem
• scientific article; zbMATH DE number 177561
• Upper bounds and exact algorithms for \(p\)-dispersion problems

Cited in

(15)

• scientific article; zbMATH DE number 177561 (Why is no real title available?)
• Dispersion on trees
• Analytical models for locating undesirable facilities
• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Good solutions to discrete noxious location problems via metaheuristics
• The equitable dispersion problem
• A branch-and-cut method for the obnoxious \(p\)-median problem
• A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
• Subset selection from large datasets for kriging modeling
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
• Dispersion with connectivity in wireless mesh networks
• The discrete p-maxian location problem
• On linearization techniques for budget-constrained binary quadratic programming problems
• An integer programming approach for solving the \(p\)-dispersion problem
• On the unified dispersion problem: efficient formulations and exact algorithms

This page was built for publication:

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