Search Results

There are 234695 results for: content related to: Optimisation and the selection of conservation contracts *

  1. Impact of Number of Interactions, Different Interaction Patterns, and Human Inconsistencies on Some Hybrid Evolutionary Multiobjective Optimization Algorithms

    Decision Sciences

    Volume 46, Issue 5, October 2015, Pages: 981–1006, Jon Marquis, Esma S. Gel, John W. Fowler, Murat Köksalan, Pekka Korhonen and Jyrki Wallenius

    Version of Record online : 17 SEP 2015, DOI: 10.1111/deci.12180

  2. The Knapsack Problem

    Fibonacci and Lucas Numbers with Applications

    Thomas Koshy, Pages: 356–359, 2011

    Published Online : 28 OCT 2011, DOI: 10.1002/9781118033067.ch30

  3. The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem

    Networks

    Volume 31, Issue 4, July 1998, Pages: 205–216, Dong X. Shaw and Geon Cho

    Version of Record online : 7 DEC 1998, DOI: 10.1002/(SICI)1097-0037(199807)31:4<205::AID-NET1>3.0.CO;2-H

  4. The knapsack problem: A survey

    Naval Research Logistics Quarterly

    Volume 22, Issue 1, March 1975, Pages: 127–144, Harvey M. Salkin and Cornelis A. De Kluyver

    Version of Record online : 21 NOV 2006, DOI: 10.1002/nav.3800220110

  5. 0–1 Knapsack Problems

    Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

    Gérard Plateau, Anass Nagih, Pages: 215–242, 2013

    Published Online : 13 FEB 2013, DOI: 10.1002/9781118600207.ch8

  6. You have full text access to this Open Access content
    Revenue maximization in the dynamic knapsack problem

    Theoretical Economics

    Volume 6, Issue 2, May 2011, Pages: 157–184, Deniz Dizdar, Alex Gershkov and Benny Moldovanu

    Version of Record online : 9 MAY 2011, DOI: 10.3982/TE700

  7. The lexicographic α-robust knapsack problem

    International Transactions in Operational Research

    Volume 18, Issue 1, January 2011, Pages: 103–113, Rim Kalaï and Daniel Vanderpooten

    Version of Record online : 11 OCT 2010, DOI: 10.1111/j.1475-3995.2010.00786.x

  8. An algorithm for 0-1 multiple-knapsack problems

    Naval Research Logistics Quarterly

    Volume 25, Issue 3, September 1978, Pages: 571–579, Ming S. Hung and John C. Fisk

    Version of Record online : 21 NOV 2006, DOI: 10.1002/nav.3800250316

  9. Cover inequalities for robust knapsack sets—Application to the robust bandwidth packing problem

    Networks

    Volume 59, Issue 1, January 2012, Pages: 59–72, Olivier Klopfenstein and Dritan Nace

    Version of Record online : 1 DEC 2011, DOI: 10.1002/net.20488

  10. The knapsack problem with a minimum filling constraint

    Naval Research Logistics (NRL)

    Volume 60, Issue 1, February 2013, Pages: 56–63, Zhou Xu

    Version of Record online : 3 JAN 2013, DOI: 10.1002/nav.21520

  11. Design and evaluation of a parallel neighbor algorithm for the disjunctively constrained knapsack problem

    Concurrency and Computation: Practice and Experience

    Zhe Quan and Lei Wu

    Version of Record online : 12 MAY 2016, DOI: 10.1002/cpe.3848

  12. Balancing profits and costs on trees

    Networks

    Volume 61, Issue 3, May 2013, Pages: 200–211, Sofie Coene, Carlo Filippi, Frits C. R. Spieksma and Elisa Stevanato

    Version of Record online : 19 MAY 2012, DOI: 10.1002/net.21469

  13. Polynomial time approximation schemes for class-constrained packing problems

    Journal of Scheduling

    Volume 4, Issue 6, November/December 2001, Pages: 313–338, Hadas Shachnai and Tami Tamir

    Version of Record online : 9 NOV 2001, DOI: 10.1002/jos.86

  14. Cryptography

    Foundations of Coding: Theory and Applications of Error-Correcting Codes with an Introduction to Cryptography and Information Theory

    Jiří Adámek, Pages: 291–317, 2011

    Published Online : 15 FEB 2011, DOI: 10.1002/9781118033265.ch15

  15. An Upper Bound for the Integer Quadratic Multi-knapsack Problem

    Combinatorial Optimization and Theoretical Computer Science

    Dominique Quadri, Eric Soutif, Pierre Tolla, Pages: 495–505, 2010

    Published Online : 3 FEB 2010, DOI: 10.1002/9780470611098.ch19

  16. An approximate method for nonlinear integer programming problems

    Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

    Volume 82, Issue 4, April 1999, Pages: 64–70, Akinori Iwasaki, Hirokazu Ohtagaki, Yuji Nakagawa, Fumiyoshi Miyashita and Hiroyuki Narihisa

    Version of Record online : 6 JAN 1999, DOI: 10.1002/(SICI)1520-6440(199904)82:4<64::AID-ECJC8>3.0.CO;2-Q

  17. Market-Based Allocation with Indivisible Bids

    Production and Operations Management

    Volume 16, Issue 4, July-August 2007, Pages: 495–509, L. Julian Schvartzman and Michael P. Wellman

    Version of Record online : 5 JAN 2009, DOI: 10.1111/j.1937-5956.2007.tb00275.x

  18. An Approach for Optimal Allocation of Safety Resources: Using the Knapsack Problem to Take Aggregated Cost-Efficient Preventive Measures

    Risk Analysis

    Volume 33, Issue 11, November 2013, Pages: 2056–2067, Genserik L. L. Reniers and Kenneth Sörensen

    Version of Record online : 28 MAR 2013, DOI: 10.1111/risa.12036

  19. Hybrid approaches for the two-scenario max–min knapsack problem

    International Transactions in Operational Research

    Volume 19, Issue 3, May 2012, Pages: 353–378, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut and Arnaud Fréville

    Version of Record online : 17 JAN 2012, DOI: 10.1111/j.1475-3995.2011.00836.x

  20. A parallel algorithm for the integer knapsack problem

    Concurrency: Practice and Experience

    Volume 8, Issue 4, May 1996, Pages: 251–260, D. Morales, J.L. Roda, C. Rodríguez, F. Almeida and F. García

    Version of Record online : 4 DEC 1998, DOI: 10.1002/(SICI)1096-9128(199605)8:4<251::AID-CPE203>3.0.CO;2-D