A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6484172 / rank
 
Normal rank
Property / zbMATH Keywords
 
quadratic integer optimization
Property / zbMATH Keywords: quadratic integer optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial solvable case
Property / zbMATH Keywords: polynomial solvable case / rank
 
Normal rank
Property / zbMATH Keywords
 
box constrained
Property / zbMATH Keywords: box constrained / rank
 
Normal rank

Revision as of 23:13, 30 June 2023

scientific article
Language Label Description Also known as
English
A polynomial case of convex integer quadratic programming problems with box integer constraints
scientific article

    Statements

    A polynomial case of convex integer quadratic programming problems with box integer constraints (English)
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    quadratic integer optimization
    0 references
    polynomial solvable case
    0 references
    box constrained
    0 references

    Identifiers