scientific article; zbMATH DE number 1757962
From MaRDI portal
Publication:4537750
zbMath1010.90515MaRDI QIDQ4537750
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810293
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Narrow Proofs May Be Maximally Long, Minotaur: a mixed-integer nonlinear optimization toolkit, Fair Colorful k-Center Clustering, Lift-and-project ranks and antiblocker duality, Mathematical Programming Models and Exact Algorithms, Integrality gaps for strengthened linear relaxations of capacitated facility location, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Copositive programming motivated bounds on the stability and the chromatic numbers, Conic mixed-integer rounding cuts, Copositivity cuts for improving SDP bounds on the clique number, Lehman's Theorem and the Directed Steiner Tree Problem, Tree-width and the Sherali-Adams operator, Communication Lower Bounds via Critical Block Sensitivity, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps, Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators, Semidefinite representations for finite varieties, Strengthened semidefinite programming bounds for codes, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Evaluating approximations of the semidefinite cone with trace normalized distance, Tight size-degree bounds for sums-of-squares proofs, Bootstrap, Markov chain Monte Carlo, and LP/SDP hierarchy for the lattice Ising model, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, A knapsack intersection hierarchy, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases, On vanishing sums of roots of unity in polynomial calculus and sum-of-squares, A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs, Minimal arc-sets spanning dicycles, Ensemble clustering using semidefinite programming with applications, Improved Approximation Guarantees through Higher Levels of SDP Hierarchies, A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, Strengthening convex relaxations of 0/1-sets using Boolean formulas, Approximate formulations for 0-1 knapsack sets, Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes, Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack, Lift \& project systems performing on the partial-vertex-cover polytope, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Two new reformulation convexification based hierarchies for 0-1 MIPs, Binary quadratic optimization problems that are difficult to solve by conic relaxations, A new lift-and-project operator, Geometric proofs for convex hull defining formulations, Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, A computational study on the quadratic knapsack problem with multiple constraints, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Unnamed Item, A Comprehensive Analysis of Polyhedral Lift-and-Project Methods, Polyhedral approximations of the semidefinite cone and their application, Valid inequalities for mixed integer linear programs, Convex Relaxations and Integrality Gaps, Invariant Semidefinite Programs, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Sum-of-squares hierarchies for binary polynomial optimization, Exact dual bounds for some nonconvex minimax quadratic optimization problems, Sum-of-squares hierarchies for binary polynomial optimization, A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations, No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ, New Tools for Graph Coloring, Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope, Matroid optimization problems with monotone monomials in the objective, Unnamed Item, Polyhedra related to integer-convex polynomial systems, Approximate fixed-rank closures of covering problems, Sparse learning via Boolean relaxations, Between steps: intermediate relaxations between big-M and convex hull formulations, Lasserre integrality gaps for graph spanners and related problems, Fair colorful \(k\)-center clustering
