Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

DOI10.1007/S10878-007-9105-1zbMATH Open1180.90201OpenAlexW2169874886MaRDI QIDQ841599FDOQ841599

Authors: Dominique Quadri, Éric Soutif, Pierre Tolla 

Publication date: 18 September 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://basepub.dauphine.fr/handle/123456789/3950

Recommendations

• Exact solution methods for the \(k\)-item quadratic knapsack problem
• Improving an exact approach for solving separable integer quadratic knapsack problems
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
• Upper bounds for large scale integer quadratic multidimensional knapsack problems
• Solution of large quadratic knapsack problems through aggressive reduction
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• An exact algorithm for large multiple knapsack problems
• Exact solution of a class of nonlinear knapsack problems
• Exact methods for the knapsack problem and its generalizations

zbMATH Keywords

integer programminglinearizationbranch-and-boundsurrogate relaxationseparable quadratic function

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• The nonlinear knapsack problem - algorithms and applications
• Surrogate Constraint Duality in Mathematical Programming
• Solution of large quadratic knapsack problems through aggressive reduction
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• An Integer Programming Algorithm for Portfolio Selection
• A branch and search algorithm for a class of nonlinear knapsack problems
• On the numerical realization of the exact penalty method for quadratic programming algorithms
• Integer quadratic optimization
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
• A Survey of Methods for Pure Nonlinear Integer Programming
• Constraint Pairing In Integer Programming
• Upper bounds for large scale integer quadratic multidimensional knapsack problems

Cited In (17)

• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
• Simple solution methods for separable mixed linear and quadratic knapsack problem
• Computational experience with a core-based reduction procedure for the 2-knapsack problem
• Integer quadratic knapsack problems
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• Two-stage quadratic integer programs with stochastic right-hand sides
• Improving an exact approach for solving separable integer quadratic knapsack problems
• Completely positive and copositive program modelling for quadratic optimization problems
• Upper bounds for large scale integer quadratic multidimensional knapsack problems
• A decision space algorithm for multiobjective convex quadratic integer optimization
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
• Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
• Pilot pattern design scheme with branch and bound in PSA-OFDM system
• Two-agent advertisement scheduling on physical books to maximize the total profit
• A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments

This page was built for publication: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841599)