Solving linear programs with complementarity constraints using branch-and-cut (Q2281449): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962818638 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.02941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive cuts for continuous linear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex quadratic programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conic QPCCs, conic QCQPs and completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized assignment problem with special ordered sets: a polyhedral approach. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for complementarity-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut for linear programs with overlapping SOS1 constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility pump 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An RLT approach for solving the binary-constrained mixed linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Integer Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three enhancements for optimization-based bound tightening / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed logical-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Use of Cuts in Complementary Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the difference-of-convex approach for solving linear programs with complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-Planes for Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential LCP method for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global resolution of the support vector machine regression parameters selection problem with LPCC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Methods for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three modeling paradigms in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimization of the value-at-risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms / rank
 
Normal rank

Latest revision as of 08:35, 21 July 2024

scientific article
Language Label Description Also known as
English
Solving linear programs with complementarity constraints using branch-and-cut
scientific article

    Statements

    Solving linear programs with complementarity constraints using branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear programs with complementarity constraints
    0 references
    MPECs
    0 references
    branch-and-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references