A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2010.05.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984447857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:24, 5 July 2024

scientific article
Language Label Description Also known as
English
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
scientific article

    Statements

    A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (English)
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    integer quadratic programming
    0 references
    non separable function
    0 references
    linearization techniques
    0 references
    knapsack problems
    0 references
    0 references