Lagrangian solution of maximum dispersion problems

DOI10.1002/(SICI)1520-6750(200003)47:2%3C97::AID-NAV2%3E3.0.CO;2-2MaRDI QIDQ4949160zbMATH OpenOpenAlexFDO

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

Publication date 5 December 2001

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(200003)47:2%3C97::aid-nav2%3E3.0.co;2-2

zbMATH Keywords

Lagrangian approachmaximum dispersion problems

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds and exact algorithms for \(p\)-dispersion problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• The discrete p-dispersion problem
• scientific article; zbMATH DE number 36716

Cites work

• A discrete optimization model for preserving biological diversity
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Analytical models for locating undesirable facilities
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Computational aspects of the maximum diversity problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• The discrete p-dispersion problem
• The discrete p-maxian location problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(12)

• A heuristic approach for the max-min diversity problem based on max-clique
• The equitable dispersion problem
• A new compact formulation for the discrete p-dispersion problem
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
• Measuring diversity. A review and an empirical analysis
• 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
• Maximum diversity/similarity models with extension to part grouping
• Subset selection from large datasets for kriging modeling
• Heuristic solution approaches for the maximum minsum dispersion problem
• Different formulations of the gray pattern problem and their optimal solutions
• A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: Lagrangian solution of maximum dispersion problems

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