Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Implementation of an Interactive Optimization System for Telephone Network Planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositivity cuts for improving SDP bounds on the clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable solution of large scale problems over the doubly nonnegative cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting special structure in semidefinite programming: a survey of theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive programming motivated bounds on the stability and the chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interior-Point Warmstarts for Linear and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Operator $\Psi$ for the Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constraint reduction for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short-Cut Potential Reduction Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Approaches to Max-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Relaxations in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction augmented Lagrangian methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank

Latest revision as of 18:01, 6 July 2024

scientific article
Language Label Description Also known as
English
Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
scientific article

    Statements

    Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (English)
    0 references
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    stable set
    0 references
    maximum clique
    0 references
    theta number
    0 references
    semidefinite programming
    0 references
    interior-point algorithms
    0 references
    cutting-plane methods
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references