Relocation problems arising in conservation biology
From MaRDI portal
Publication:1963365
DOI10.1016/S0898-1221(99)00065-6zbMATH Open0938.92035WikidataQ113858715 ScholiaQ113858715MaRDI QIDQ1963365FDOQ1963365
Authors: Michael M. Kostreva, W. Ogryczak, D. W. Tonkyn 
Publication date: 26 January 2000
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
- A nonlocal problem from conservation biology
- Linking animal movement to site fidelity
- Linking dispersal and immigration in multidimensional environments
- Moving-habitat models: a numerical approach
- scientific article; zbMATH DE number 1487906
- Adaptation and migration of a population between patches
- Conservation effort and assessment of population size in fluctuating environments
- A model of optimal migration of locally informed beings
- scientific article; zbMATH DE number 4035633
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A mathematical basis for satisficing decision making
- Title not available (Why is that?)
- Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
- Title not available (Why is that?)
- The Nucleolus of a Matrix Game and Other Nucleoli
- The general nucleolus and the reduced game property
- Complexity results for a class of min-max problems with robust optimization applications
- Aspiration/reservation‐based decision support—a step beyond goal programming
Cited In (14)
- Inverse multi-objective combinatorial optimization
- Title not available (Why is that?)
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Labeling algorithms for multiple objective integer knapsack problems
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- A time-dependent multiple criteria single-machine scheduling problem
- Dispersal and settling of translocated populations: a general study and a New Zealand amphibian case study
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
- On some multiobjective optimization problems arising in biology
- Fair optimization and networks: a survey
This page was built for publication: Relocation problems arising in conservation biology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963365)
