Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 86, 2009 - Issue 5
Submit an article Journal homepage
72
Views
7
CrossRef citations to date
0
Altmetric
Section A

A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem

Fumiaki Taniguchi Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa, Japan
,
Takeo Yamada Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa, JapanCorrespondence[email protected]
&
Seiji Kataoka Department of Computer Science, National Defense Academy, Yokosuka, Kanagawa, Japan
Pages 779-793 | Received 28 Jan 2007, Accepted 17 Sep 2007, Published online: 23 Apr 2009

References

  • Balas , E. and Zemel , E. 1980 . An algorithm for large zero-one knapsack problems . Oper. Res. , 28 : 1130 – 1154 .
  • CPLEX 10.0 . 2007 . ILOG . software available at http://www.ilog.com/products/cplex/news/whatsnew.cfm
  • Dembo , R. S. and Hammer , P. L. 1980 . A reduction algorithm for knapsack problems . Methods Oper. Res. , 36 : 49 – 60 .
  • Eben-Chaime , M. 1996 . Parametric solution for linear bicriteria knapsack models . Manag. Sci. , 42 : 1565 – 1575 .
  • Fayard , D. and Plateau , G. 1975 . Resolution of the 0-1 knapsack problem: comparison of methods . Math. Program. , 8 : 272 – 307 .
  • Fisher , M. 2004 . The Lagrangian relaxation method for solving integer programming problems . Manage. Sci. , 50 : 1861 – 1871 .
  • Fourer , R. 1999 . Software survey: linear programming . OR/MS Today , 26 : 64 – 71 .
  • Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , New York : Freeman and Company .
  • Glover , F. 1975 . Surrogate constraint duality in mathematical programming . Oper. Res. , 23 : 434 – 451 .
  • Iida , H. 1999 . A note on the max-min 0-1 knapsack problem . J. Comb. Optim. , 3 : 89 – 94 .
  • Ingargiola , G. P. and Korsh , F. F. 1973 . Reduction algorithms for zero-one single knapsack problems . Manage. Sci. , 20 : 460 – 463 .
  • Kellerer , H. , Pferschy , U. and Pisinger , D. 2004 . Knapsack Problems , Berlin : Springer .
  • Kouvelis , P. and Yu , G. 1997 . “ Robust Discrete Optimization and Its Applications ” . Dordrecht : Kluwer .
  • Lueker , G. 1982 . “ On the average difference between the solutions to linear and integer knapsack problems ” . In Applied Probability – Computer Science, The Interface I , Edited by: Disney , R. L. and Otter , T. J. 489 – 504 . Boston, MA : Birkhauser .
  • Martello , S. and Toth , P. 1990 . Knapsack Problems: Algorithms and Computer Implementations , New York : Wiley .
  • NUOPT Ver. 3.3.0 . 2002 . software available at http://www.msi.co.jp/nuopt
  • Taniguchi , F. , Yamada , T. and Kataoka , S. 2008 . Heuristic and exact algorithms for the max-min optimization of the multi-criteria knapsack problem . Comput. Oper. Res. , 35 : 2034 – 2048 .
  • Wolsey , L. A. 1998 . Integer Programming , New York : Wiley .
  • XPRESS-MP release 2005B . 2005 . Dash Optimization . software available at http://www.dashoptimization.com
  • You , B.-J. and Yamada , T. 2007 . A virtual pegging approach to the precedence constrained knapsack problem . Eur. J. Oper. Res. , 183 : 618 – 632 .
  • Yu , G. 1996 . On the max-min 0-1 knapsack problem with robust optimization applications . Oper. Res. , 44 : 407 – 415 .
  • Zhang , C.-N. and Ong , H.-L. 2004 . Solving the bicriteria zero-one knapsack problem by an efficient LP-based heuristic . Eur. J. Oper. Res. , 159 : 545 – 557 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.