Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear complementarity problems solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of disjunctive programming to the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit enumeration procedure for the general linear complementarity problem / 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: Q4308909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral convexity cuts and negative edge extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving maximum-problems with a nonconcave quadratic objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the bilinear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivoting rules and redundancy schemes in extreme point enumeration / 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: Implementing a random number package with splitting facilities / rank
 
Normal rank

Revision as of 10:11, 27 May 2024

scientific article
Language Label Description Also known as
English
Enhanced intersection cutting-plane approach for linear complementarity problems
scientific article

    Statements

    Enhanced intersection cutting-plane approach for linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 1997
    0 references
    0 references
    nonconvex programming
    0 references
    cutting planes
    0 references
    vertex ranking
    0 references
    enhanced intersection cutting-plane algorithm
    0 references
    mixed integer 0-1 bilinear programming
    0 references
    linear complementarity
    0 references
    Tuy intersection cuts
    0 references
    0 references
    0 references
    0 references
    0 references