https://doi.org/10.2307/2582400 • https://www.jstor.org/stable/2582400 Copy URL This paper offers a new approach to the solution of zero-one goal-programming ...

Selection is a decision or question. At some point in an algorithm there may need to be a question because the algorithm has reached a step where one or more options are available. Depending on the ...

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

This paper reconstructs the history of the introduction and use of iterative algorithms in conservation biology in the 1980s and early 1990s in order to prioritize areas for protection as nature ...