Linear complementarity problems solvable by integer programming (Q3798493): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Algorithms: A Framework and State-of-the-Art Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of solutions to the complementarity problem and spanning properties of complementary cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization Approach to the Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the solution set of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank

Latest revision as of 17:36, 18 June 2024

scientific article
Language Label Description Also known as
English
Linear complementarity problems solvable by integer programming
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references