Exploiting nested inequalities and surrogate constraints

Balas, 1975, Facets of the knapsack polytope, Mathematical Programming, 8, 146, 10.1007/BF01580440 Crowder, 1983, Solving large-scale zero–one linear programming problems, Operations Research, 31, 803, 10.1287/opre.31.5.803 Fischer, 1981, The Lagrangean relaxation method for solving integer programming problems, Management Sciences, 27, 1, 10.1287/mnsc.27.1.1 Fréville, 2004, The multidimensional 0–1 knapsack problem: An overview, invited review, European Journal of Operational Research, 155, 1, 10.1016/S0377-2217(03)00274-1 Fréville, 2005, The multidimensional 0–1 knapsack problem – Bounds and computational aspects, Annals of Operations Research, 139, 195, 10.1007/s10479-005-3448-8 Fréville, 1993, An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem, European Journal of Operational Research, 68, 413, 10.1016/0377-2217(93)90197-U Geoffrion, 1974, The Lagrangean relaxation for integer programming, Mathematical Programming Study, 2, 82, 10.1007/BFb0120690 Glover, 1965, A multiphase-dual algorithm for the zero–one integer programming problem, Operations Research, 13, 879, 10.1287/opre.13.6.879 Glover, 1968, Surrogate constraints, Operations Research, 16, 741, 10.1287/opre.16.4.741 Glover, 1971, Flows in arborescences, Management Science, 17, 568, 10.1287/mnsc.17.9.568 Greenberg, 1970, Surrogate mathematical programs, Operations Research, 18, 924, 10.1287/opre.18.5.924 Hammer, 1975, Facets of regular 0–1 polytopes, Mathematical Programming, 8, 179, 10.1007/BF01580442 Hanafi, S., 1993. Contribution à la résolution de problèmes duaux de grande taille en optimisation combinatoire, PhD thesis, University of Valenciennes, France. Karwan, 1984, Surrogate dual multiplier search procedures in integer programming, Operations Research, 32, 52, 10.1287/opre.32.1.52 Osorio, 2004, Cutting analysis for MKP, 298, 10.1109/ENC.2004.1342620 Osorio, 2002, Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Annals of Operations Research, 117, 71, 10.1023/A:1021513321301 Wolsey, 1975, Faces for a linear inequality in 0–1 variables, Mathematical Programming, 8, 165, 10.1007/BF01580441