Pages that link to "Item:Q4012419"

The following pages link to Cones of Matrices and Set-Functions and 0–1 Optimization (Q4012419):

Displaying 50 items.

• Approximate fixed-rank closures of covering problems (Q2583148) (← links)
• Small Chvátal rank (Q2638380) (← links)
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
• Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
• A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
• Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
• A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming (Q2788727) (← links)
• A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
• Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
• The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
• Convex Hulls of Algebraic Sets (Q2802521) (← links)
• Convex Relaxations and Integrality Gaps (Q2802523) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
• Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
• Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
• Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
• Strength of facets for the set covering and set packing polyhedra on circulant matrices (Q2840523) (← links)
• Some advances on lovász-schrijver \(N_+(\cdot)\) relaxations of the fractional stable set polytope (Q2840707) (← links)
• On the facets of the lift-and-project relaxations of graph subdivisions (Q2840709) (← links)
• Near-perfect graphs with polyhedral \(N_+(G)\) (Q2840742) (← links)
• A comparison between lift-and-project indices and imperfection ratio on web graphs (Q2861537) (← links)
• Rank of random half-integral polytopes. Extended abstract (Q2883588) (← links)
• A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (Q2892140) (← links)
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
• Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
• Characterizing N+-perfect line graphs (Q2968506) (← links)
• Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
• Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
• Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
• New Tools for Graph Coloring (Q3088076) (← links)
• SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems (Q3157861) (← links)
• Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
• (Q3191144) (← links)
• Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
• Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices (Q3200884) (← links)
• The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)