An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem

DOI10.1016/0377-2217(93)90197-UzbMath0782.90069OpenAlexW2088888085MaRDI QIDQ1309925

Gérard Plateau, Arnaud Fréville

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90197-u

zbMATH Keywords

dichotomic searchsurrogate dual\(0-1\) bidimensional knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems, Hybrid approaches for the two-scenario max-min knapsack problem, Exploiting nested inequalities and surrogate constraints, Local search with memory: Benchmarking RTS, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem, A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem, The multidimensional 0-1 knapsack problem: an overview., Shift-and-merge technique for the DP solution of the time-constrained backpacker problem, Simple and fast surrogate constraint heuristics for the maximum independent set problem, New trends in exact algorithms for the \(0-1\) knapsack problem, Heuristics for the 0-1 multidimensional knapsack problem, Revisiting surrogate relaxation for the multidimensional knapsack problem, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the solution of the 0-1 knapsack problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• Calculating surrogate constraints
• Constructive Duality in Integer Programming
• Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
• Surrogate Mathematical Programming