Lagrangian solution of maximum dispersion problems

DOI<97::AID-NAV2>3.0.CO;2-2 10.1002/(SICI)1520-6750(200003)47:2<97::AID-NAV2>3.0.CO;2-2zbMath0973.90062OpenAlexW1963941300MaRDI QIDQ4949160

Jay B. Ghosh, Burak Eksioglu, Şenay Ağca

Publication date: 5 December 2001

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(200003)47:2<97::aid-nav2>3.0.co;2-2

zbMATH Keywords

Lagrangian approachmaximum dispersion problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Subset selection from large datasets for kriging modeling ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ Maximum diversity/similarity models with extension to part grouping ⋮ Measuring diversity. A review and an empirical analysis ⋮ A heuristic approach for the max-min diversity problem based on max-clique ⋮ The equitable dispersion problem ⋮ Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion

Uses Software

• LINDO

Cites Work

• Unnamed Item
• The discrete p-dispersion problem
• Analytical models for locating undesirable facilities
• Computational aspects of the maximum diversity problem
• The discrete p-maxian location problem
• A discrete optimization model for preserving biological diversity
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Heuristic and Special Case Algorithms for Dispersion Problems