A simple procedure for solving a continuous quadratic mathematical model.

DOI10.1016/S0096-3003(99)00080-6MaRDI QIDQ5931607zbMATH OpenOpenAlexFDO

Authors Mohamed Djerdjour

Publication date 25 April 2001

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0096-3003(99)00080-6

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
• On the continuous quadratic knapsack problem
• Linear programming for the \(0-1\) quadratic knapsack problem
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem

Cites work

• A branch and search algorithm for a class of nonlinear knapsack problems
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• Calculating surrogate constraints
• Duality in Discrete Programming: II. The Quadratic Case
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• Surrogate Constraint Duality in Mathematical Programming
• Surrogate Dual Multiplier Search Procedures in Integer Programming

This page was built for publication: A simple procedure for solving a continuous quadratic mathematical model.

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