A discrete optimization model for preserving biological diversity

DOI10.1016/0307-904X(95)00083-VzbMATH0837.92024OpenAlexW2121387353WikidataQ113881776MaRDI QIDQ1909481FDOQ1909481

Authors Fred Glover, Ching-Chung Kuo, Krishna S. Dhir

Publication date 12 March 1996

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904x(95)00083-v

zbMATH Keywords

data analysisdynamic programmingresource constraintscrane familyecological conservation policiesinterspecies dissimilarity indexmaximizing biological diversity

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Ecology (92D40) Integer programming (90C10)

Recommendations

• Mathematical optimization ideas for biodiversity conservation
• Forest management optimisation models and habitat diversity: a goal programming approach
• NP-hard problems in biodiversity preservation models
• Measuring diversity. A review and an empirical analysis
• The Noah's Ark Problem

Cites work

• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• An Improved MIP Formulation for Products of Discrete and Continuous Variables
• Further Improvements in the Polynomial Zero-One Algorithm
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• On Diversity
• Quadratic Binary Programming with Application to Capital-Budgeting Problems
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program

Cited in

(15)

• A review on discrete diversity and dispersion maximization from an OR perspective
• Mathematical optimization ideas for biodiversity conservation
• Heuristic solution approaches for the maximum minsum dispersion problem
• Tabu search versus GRASP for the maximum diversity problem
• Measuring diversity. A review and an empirical analysis
• Heuristic algorithms for the maximum diversity problem
• Forest management optimisation models and habitat diversity: a goal programming approach
• NP-hard problems in biodiversity preservation models
• Tabu search and GRASP for the maximum diversity problem
• Maximum diversity/similarity models with extension to part grouping
• Lagrangian solution of maximum dispersion problems
• Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment
• GRASP and path relinking for the equitable dispersion problem
• Budgeted nature reserve selection with diversity feature loss and arbitrary split systems
• VNS variants for the Max-Mean dispersion problem

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: A discrete optimization model for preserving biological diversity

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