Branch-and-cut for complementarity-constrained optimization (Q482112): 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: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C33 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6381889 / rank
 
Normal rank
Property / zbMATH Keywords
 
complementarity
Property / zbMATH Keywords: complementarity / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple-choice
Property / zbMATH Keywords: multiple-choice / rank
 
Normal rank
Property / zbMATH Keywords
 
special ordered set
Property / zbMATH Keywords: special ordered set / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed-integer programming
Property / zbMATH Keywords: mixed-integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack set
Property / zbMATH Keywords: knapsack set / rank
 
Normal rank
Property / zbMATH Keywords
 
polyhedral method
Property / zbMATH Keywords: polyhedral method / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / rank
 
Normal rank

Revision as of 20:33, 30 June 2023

scientific article
Language Label Description Also known as
English
Branch-and-cut for complementarity-constrained optimization
scientific article

    Statements

    Branch-and-cut for complementarity-constrained optimization (English)
    0 references
    0 references
    0 references
    19 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complementarity
    0 references
    multiple-choice
    0 references
    special ordered set
    0 references
    mixed-integer programming
    0 references
    knapsack set
    0 references
    polyhedral method
    0 references
    branch-and-cut
    0 references