Branch-and-cut for complementarity-constrained optimization (Q482112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ismael Regis jun. de Farias / rank
Normal rank
 
Property / author
 
Property / author: Ming Zhao / rank
Normal rank
 
Property / author
 
Property / author: Ismael Regis jun. de Farias / rank
 
Normal rank
Property / author
 
Property / author: Ming Zhao / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
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.1007/s12532-014-0070-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035640668 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:06, 19 March 2024

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
    0 references