A discrete optimization model for preserving biological diversity
From MaRDI portal
Publication:1909481
DOI10.1016/0307-904X(95)00083-VzbMath0837.92024OpenAlexW2121387353WikidataQ113881776 ScholiaQ113881776MaRDI QIDQ1909481
Ching-Chung Kuo, Krishna S. Dhir, Fred Glover
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
dynamic programmingdata analysisresource constraintscrane familyecological conservation policiesinterspecies dissimilarity indexmaximizing biological diversity
Related Items
VNS variants for the Max-Mean dispersion problem, GRASP and path relinking for the equitable dispersion problem, Tabu search and GRASP for the maximum diversity problem, Lagrangian solution of maximum dispersion problems, A review on discrete diversity and dispersion maximization from an OR perspective, Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment, Tabu search versus GRASP for the maximum diversity problem, Heuristic solution approaches for the maximum minsum dispersion problem, Maximum diversity/similarity models with extension to part grouping, Heuristic algorithms for the maximum diversity problem, Measuring diversity. A review and an empirical analysis, Mathematical optimization ideas for biodiversity conservation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An Improved MIP Formulation for Products of Discrete and Continuous Variables
- On Diversity
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- Further Improvements in the Polynomial Zero-One Algorithm
