Skip to main content
Springer Nature Link
Log in

The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Efficient codes exist for exactly solving the 0-1 knapsack problem, which is a common primitive structure in relaxation and decomposition techniques for the solution of general models. We suggest moving to a higher primitive level by using the bidimensional knapsack, which can be used to enhance linear programming or Lagrangean type classical relaxations.

With the ultimate aim of providing an exact and efficient solution to the bidimensional knapsack problem, we describe here a heuristic approach based on surrogate duality. In particular, we consider the usefulness of a specific preprocessing phase before a possible enumerative phase.

Extensive numerical experiments, based on test problems from the literature as well as randomly generated instances, show that our code compares favorably with the GP procedure developed by Gavish and Pirkul for the multidimensional case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Andonov, R.A. (1987). “Finding Facets of the Knapsack Polytope Which Cut Off a Given Point.” Comptes Rendus de l'Académie Bulgare des Sciences 41–44.

  • Balas, E., S. Ceria, and G. Cornuejols. (1993). “A Lift-and-Project Cutting Plane Algorithm for Mixed 0–1 Programs.” Mathematical Programming 58(3), 295–325.

    Google Scholar 

  • Balas, E., and E. Zemel. (1980). “An Algorithm for Large Zero-One Knapsack Problems.” Operations Research 28, 1130–1145.

    Google Scholar 

  • Bourgeois, P., A. Fréville, S. Hanafi, and G. Plateau. (1993). “FPBK92: An Algorithm for the Exact Solution of the 0-1 Bidimensional Knapsack Problem.” ORSA/TIMS Joint National Meeting, Phoenix (USA).

  • Bourgeois, P., and G. Plateau. (1992). “BPK92: A Revisited Hybrid Algorithm for the 0-1 Knapsack Problem.” Congrès EURO XI, Helsinki.

  • Chajakis, E., and M. Guignard. (1992). “A Model for Delivery of Groceries in Vehicles with Multiple Compartments and Lagrangean Approximation Schemes.” VI Congreso Latino-Ibero-Americano de Investigation de Operacionese e Ingenieria de Sistemas, Mexico City, October.

  • Cook, S.A. (1971). “The Complexity of Theorem-Proving Procedures.” Proceedings of the Third Annual ACM Symposium on Theory of Computing Machinery (pp. 151–158). New York.

  • Crowder, H., E. Johnson, and M. Padberg. (1983). “Solving Large-Scale Zero-One Linear Programming Problems.” Operations Research 31 (5), 803–834.

    Google Scholar 

  • Dammeyer, F., and S. Voss. (1993). “Dynamic Tabu List Management Using the Reverse Elimination Method.” Annals of Operations Research 41, 31–46.

    Google Scholar 

  • Dietrich, B.L., and L.F. Escudero. (1990). “Coefficient Reduction Procedure for Knapsack-like Constraints in 0–1 Programs with Variable Upper Bounds.” Operations Research Letters 9(1), 9–14.

    Google Scholar 

  • Dietrich, B.L., and L.F. Escudero. (1992). “On Tightening Cover Induced Inequalities.” European Journal of Operational Research 60, 335–343.

    Google Scholar 

  • Dietrich, B.L., L.F. Escudero, and F. Chance. (1993). “Effect Reformulation for 0–1 Programs: Methods and Computational Results.” Discrete Applied Mathematics 42(2–3), 147–175.

    Google Scholar 

  • Drexl, A. (1988). “A Simulated Approach to the Multiconstraint Zero-One Knapsack Problem.” Computing 40, 1–8.

    Google Scholar 

  • Fayard, D., and G. Plateau. (1982). “An Algorithm for the Solution of the 0–1 Knapsack Problem.” Computing 28, 269–287.

    Google Scholar 

  • Fayard, D., and G. Plateau. (1994). “An Exact Algorithm for the 0–1 Collapsing Knapsack Problem.” Discrete Applied Mathematics 49, 175–187.

    Google Scholar 

  • Fischer, M.L., and J.F. Shapiro. (1974). “Constructive Duality in Integer Programming.” S.I.A.M. Journal on Applied Mathematics 27(1), 31–52.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1982). “Méthodes Heuristiques Performantes pour les Problèmes en Variables 0–1 à plusieurs Contraintes en Inégalité.” Research Report, ANO-91, Université des Sciences et Techniques de Lille, France.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1986). “Heuristic and Reduction Method for Multiple Constraints 0–1 Linear Programming Problems.” European Journal of Operational Research 24, 206–215.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1990). “Hard 0–1 Multiknapsack Test Problems for Size Reduction Methods.” Investigacion Operativa 1(3), 251–270.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1993a). “An Exact Search for the Solution of the Surrogate Dual of the 0–1 Bidimensional Knapsack Problem.” European Journal of Operational Research 68, 413–421.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1993b). “FPBK92: An Implicit Enumeration Code for the Solution of the 0-1 Bidimensional Knapsack Problem.” Research Report, Universities of Paris XIII and Valenciennes, October.

  • Fréville, A., and G. Plateau. (1993c). “Sac à dos multidimensionnel en variables 0–1: Encadrement de la somme des variables à l'optimum.” R.A.I.R.O.-Operations Research 27, 1–19.

    Google Scholar 

  • Fréville, A., and G. Plateau. (1994). “An Efficient Preprocessing Procedure for the Solution of the 0–1 Multiknapsack Problem.” Discrete Applied Mathematics 49, 189–212.

    Google Scholar 

  • Frieze, A.M., and M.R.B. Clarke. (1984). “Approximate Algorithms for m-dimensional 0–1 Knapsack Problem: Worst-Case and Probabilistic Analysis.” European Journal of Operational Research 15, 100–109.

    Google Scholar 

  • Garey, M.R., and D.S. Johnson. (1979). “Strong NP-Completeness Results: Motivation, Examples and Implications.” Journal ACM 25, 499–508.

    Google Scholar 

  • Garey, M.R., and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman.

    Google Scholar 

  • Gavish, B., and H. Pirkul. (1983). “Models for Computer and File Allocation in Distributed Computer Networks.” Working paper, Graduate School of Management, University of Rochester, New York.

    Google Scholar 

  • Gavish, B., and H. Pirkul. (1985). “Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality.” Mathematical Programming 31, 78–105.

    Google Scholar 

  • Glover, F. (1965). “A Multiphase Dual Algorithm for the Zero-One Integer Programming Problem.” Operations Research 13(6), 879–919.

    Google Scholar 

  • Glover, F. (1975a). “Neglected Heuristics in Integer Programming.” Workshop in Integer Programming, Bonn.

  • Glover, F. (1975b). “Surrogate Constraint Duality in Mathematical Programming.” Operations Research 23(3), 434–451.

    Google Scholar 

  • Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints.” Decision Sciences 8, 156–166.

    Google Scholar 

  • Glover, F., and G. Kochenberger. (1955). “Critical Event Tabu Search for Multidimensional Knapsack Problems.” Research Report, Universities of Colorado at Boulder and Denver, March.

  • Greenberg, H.J., and W.P. Pierskalla. (1970). “Surrogate Mathematical Programming.” Operations Research 18, 924–939.

    Google Scholar 

  • Guignard, M., and S. Kim. (1987a). “Lagrangean Decomposition: A Model Yielding Stronger-Lagrangean Bounds.” Mathematical Programming 39, 215–228.

    Google Scholar 

  • Guignard, M., and S. Kim. (1987b). “Lagrangean Decomposition for Integer Programming: Theory and Applications.” R.A.I.R.O.-Operations Research 21, 307–323.

    Google Scholar 

  • Guignard, M., G. Plateau, and G. Yu. (1989). “An Application of Lagrangean Decomposition to the 0-1 Biknapsack Problem.” Congress TIMS/ORSA Meeting, Vancouver.

  • Guignard, M., and K. Spielberg. (1981). “Logical Reduction Methods in Zero-One Programming: Minimal Preferred Variables.” Journal of Operations Research Society 29(I), 49–74.

    Google Scholar 

  • Hanafi, S., A. Fréville. (1996). “An Efficient Tabu Search Approach for the 0-1 Multidimensional Knapsack Problem.” To appear in European Journal of Operational Research.

  • Hanafi, S., A. Fréville, and A. El Abdellasui. (1995). “Comparison of Heuristics for the 0-1 Multidimensional Knapsack Problem.” In I.H. Osman, and J.P. Kelly (eds.), Heuristics: Theory and Applications (pp. 449–465). Kluwer Academic Publishers.

  • Hansen, P. (1974) “Programmes mathématiques en variables 0-1.” Thèse d'Agrégation, Faculté des Sciences Appliquées de l'Université Libre de Bruxelles.

  • Hoffman, K.L., and M.W. Padberg. (1989). “Techniques for Improving the LP-Representation of Zero-One Linear Programming Problems.” Rapport de Recherche no 320, Ecole Polytechnique, France.

    Google Scholar 

  • Ibarra, T., and C.E. Kim. (1975). “Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.” Journal ACM 22, 463–468.

    Google Scholar 

  • Karp, R.M. (1972). “Reducibility Among Combinatorial Problems.” In Complexity of Computer Computations (pp. 85–103). New York: Plenum Press.

    Google Scholar 

  • Karwan, M.H., and R.L. Rardin. (1981). “Surrogate Duality in a Branch and Bound Procedure.” Naval Research Logistics Quarterly 28, 93–101.

    Google Scholar 

  • Kianfar, F. (1971). “Stronger Inequalities for 0–1 Integer Programming Using Knapsack Functions.” Operations Research 19, 1374–1392.

    Google Scholar 

  • Korte, B., and R. Schrader. (1980). “On the Existence of Fast Approximate Schemes.” In O.L. Mangassarian, R.R. Meyer, and S.M. Robinson (Eds.), Nonlinear Programming (pp. 415–438). New York: Academic Press.

    Google Scholar 

  • Lorie, J., and L.J. Savage. (1955). “Three Problems in Capital Rationing.” Journal of Business 28, 229–239.

    Google Scholar 

  • Manne, A.S., and H.M. Markowitz. (1957). “On the Solution of Discrete Programming Problems.” Econometrica 25, 84–110.

    Google Scholar 

  • Martello, S., and P. Toth. (1978). “Algorithm for the Solution of the 0–1 Single Knapsack Problem.” Computing 21, 81–86.

    Google Scholar 

  • Martello, S., and P. Toth. (1988). “A New Algorithm for the 0–1 Knapsack Problem.” Management Science 34, 633–644.

    Google Scholar 

  • Martello, S., and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementation. New York: Wiley.

    Google Scholar 

  • Martello, S., and P. Toth. (1993). “Exact and Approximate Solutions of Difficult 0-1 Knapsack Problems.” IFORS93, Thirteenth World Conference on Operations Research, Lisbon.

  • Nauss, R.M. (1976). “An Efficient Algorithm for the 0–1 Knapsack Problem.” Management Science 23, 27–31.

    Google Scholar 

  • Nembauser, G.L., M.W.P. Savelsberg, and G.C. Sigismondi. (1994). “MINTO, a Mixed INTeger Optimizer.” Operations Research Letters 15(1), 47–58.

    Google Scholar 

  • Oguz, O., and M.J. Magazine. (1980). “A Polynomial Time Algorithm for the Multidimensional 0/1 Knapsack Problem.” University of Waterloo Research Report.

  • Padberg, M. (1980). “(l, k)-Configurations and Facets for Packing Problems.” Mathematical Programming 18, 94–99.

    Google Scholar 

  • Petersen, C.C. (1967). “Computational Experience with Variants of Balas Algorithm Applied to the Selection for R&D Projects.” Management Science 13(9), 736–750.

    Google Scholar 

  • Sahni, S. (1975). “Approximate Algorithms for the 0–1 Knapsack Problems.” Journal ACM 22, 115–124.

    Google Scholar 

  • Sarin, S., M.H. Karwan, and R.L. Rardin. (1988). “Surrogate Duality in a Branch-and-Bound Procedure for Integer Programming.” European Journal of Operational Research 33, 326–333.

    Google Scholar 

  • Savelsberg, M.W.P. (1994). “Preprocessing and Probing Techniques for Mixed Integer Programming Problems.” ORSA Journal on Computing 6(4), 445–454.

    Google Scholar 

  • Soyster, A.L., B. Lev, and W. Slivka. (1978). “Zero-One Programming with Many Variables are Few Constraints.” European Journal of Operational Research 2, 195–201.

    Google Scholar 

  • Spielberg, K., and M. Guignard. (1993). “Some General Principles for Practical Mixed (0,1) Programming.” APMOD, Budapest, January, OPIM Rep. 93–04–02, University of Pennsylvania.

    Google Scholar 

  • Thiel, J., and S. Voss. (1994). “Some Experiences on Solving Multiconstraint Zero-One Knapsack Problems with Genetic Algorithms.” INFOR 32(4), 226–242.

    Google Scholar 

  • Weingartner, H.M., and D.N. Ness. (1967). “Methods for the Solution of the Multidimensional 0–1 Knapsack Problem.” Operations Research 15(1), 83–103.

    Google Scholar 

  • Yu, G. (1990). “Algorithms for Optimizing Piecewise Linear Functions and for Degree Constrained Minimum Spanning Tree Problems.” Ph. D. dissertation, University of Pennsylvania.

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique et de Mathématiques Appliquées de Valenciennes, URA CNRS no 1507, Institut des Sciences et Techniques, Université de Valenciennes, BP311, 59304, Valenciennes cedex, France

    Arnaud Fréville

  2. Laboratoire d'Informatique de Paris-Nord, URA CNRS no 1507, Institut des Sciences et Techniques, Université de Valenciennes, BP311, 59304, Valenciennes cedex, France

    Arnaud Fréville

  3. Laboratoire d'Informatique de Paris-Nord, URA CNRS no 1507, Institut Galilée, Université Paris-Nord, Avenue J.B. Clément, 93430, Villetaneuse, France

    Gérard Plateau

Authors
  1. Arnaud Fréville
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Gérard Plateau
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fréville, A., Plateau, G. The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool. J Heuristics 2, 147–167 (1996). https://doi.org/10.1007/BF00247210

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00247210

Key Words