Relocation problems arising in conservation biology
From MaRDI portal
Publication:1963365
DOI10.1016/S0898-1221(99)00065-6zbMath0938.92035WikidataQ113858715 ScholiaQ113858715MaRDI QIDQ1963365
Włodzimierz Ogryczak, Michael M. Kostreva, D. W. Tonkyn
Publication date: 26 January 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Related Items
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Unnamed Item ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Inverse multi-objective combinatorial optimization ⋮ On some multiobjective optimization problems arising in biology ⋮ 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 ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ Fair optimization and networks: a survey ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- The general nucleolus and the reduced game property
- Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
- A mathematical basis for satisficing decision making
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- The Nucleolus of a Matrix Game and Other Nucleoli
- Aspiration/reservation‐based decision support—a step beyond goal programming
