Geometry of cuts and metrics
From MaRDI portal
Publication:5906765
zbMath0885.52001MaRDI QIDQ5906765
Monique Laurent, Michel Marie Deza
Publication date: 1 July 1997
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Related Items (only showing first 100 items - show all)
Remarks on non linear type and Pisiers inequality ⋮ Proper actions of wreath products and generalizations ⋮ On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems ⋮ Sparktope: linear programs from algorithms ⋮ A Polytope for a Product of Real Linear Functions in 0/1 Variables ⋮ Approximation Limits of Linear Programs (Beyond Hierarchies) ⋮ Minkowski Geometry—Some Concepts and Recent Developments ⋮ Normal binary graph models ⋮ Gorenstein cut polytopes ⋮ Determining finite connected graphs along the quadratic embedding constants of paths ⋮ The Ratio-Cut Polytope and K-Means Clustering ⋮ Speeding up IP-based algorithms for constrained quadratic 0-1 optimization ⋮ Small Cones of Oriented Semi-Metrics ⋮ Does negative type characterize the round sphere? ⋮ Negative-type diversities, a multi-dimensional analogue of negative-type metrics ⋮ Unnamed Item ⋮ Necessary conditions for extended noncontextuality in general sets of random variables ⋮ Generalised 2-circulant inequalities for the max-cut problem ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ Trigonometric approximation of the max-cut polytope is star-like ⋮ Hierarchical Models, Marginal Polytopes, and Linear Codes ⋮ Magnitude and Holmes–Thompson intrinsic volumes of convex bodies ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ Fuzzy compatibility relations and pseudo-monometrics: some correspondences ⋮ A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem ⋮ Binary Positive Semidefinite Matrices and Associated Integer Polytopes ⋮ Hypercube embeddings and Cayley graphs generated by transpositions ⋮ Entanglement of free fermions on Johnson graphs ⋮ Graph partitioning: an updated survey ⋮ Wasserstein distance and metric trees ⋮ Dimension reduction for maximum matchings and the fastest mixing Markov chain ⋮ Labelings vs. embeddings: on distributed and prioritized representations of distances ⋮ The arithmetic topology of genetic alignments ⋮ Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue ⋮ Diversities and the generalized circumradius ⋮ Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes ⋮ Tail-dependence, exceedance sets, and metric embeddings ⋮ On generalized discrete metric structures ⋮ A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems ⋮ Graphical designs and gale duality ⋮ Factorization and pseudofactorization of weighted graphs ⋮ Expander graphs and their applications ⋮ The Excluded Minors for Isometric Realizability in the Plane ⋮ Unnamed Item ⋮ Isometric Hamming embeddings of weighted graphs ⋮ Recent Developments in Discrete Convex Analysis ⋮ Euclidean distortion and the sparsest cut ⋮ Semidefinite Approximation of Closed Convex Set ⋮ A PTAS for the Steiner Forest Problem in Doubling Metrics ⋮ ARITHMETIC ASPECTS OF SYMMETRIC EDGE POLYTOPES ⋮ Encoding Binary Neural Codes in Networks of Threshold-Linear Neurons ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ On the Distortion of Locality Sensitive Hashing ⋮ Correlation matrices, Clifford algebras, and completely positive semidefinite rank ⋮ The Riemannian and Affine Geometry of Facial Expression and Action Recognition ⋮ Leggett-Garg inequalities and the geometry of the cut polytope ⋮ Comparison of Metric Spectral Gaps ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Approximating Requirement Cut via a Configuration LP ⋮ The Hypermetric Cone on Seven Vertices ⋮ Compression bounds for wreath products ⋮ Basis problem for turbulent actions. I: Tsirelson submeasures ⋮ Tangent Halfspaces to Sets of Finite Perimeter in Carnot Groups ⋮ Principal majorization ideals and optimization ⋮ On 0-1 polytopes with many facets ⋮ Unnamed Item ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ On the binary solitaire cone ⋮ Two theorems on Euclidean distance matrices and Gale transform ⋮ Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ Explicit Construction of the Voronoi and Delaunay Cells of W(An) and W(Dn) Lattices and Their Facets ⋮ Some inequalities for central moments of matrices ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Computational Approaches to Max-Cut ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ Coloring the Voronoi tessellation of lattices ⋮ The Andoni–Krauthgamer–Razenshteyn Characterization of Sketchable Norms Fails for Sketchable Metrics ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ A Tractable Class of Binary VCSPs via M-Convex Intersection ⋮ POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES ⋮ FINITE FLAT SPACES ⋮ Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Binary Component Decomposition Part I: The Positive-Semidefinite Case ⋮ The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1 ⋮ Scaling entropy and automorphisms with pure point spectrum ⋮ Threshold Dynamics for Networks with Arbitrary Surface Tensions ⋮ Engineering Branch-and-Cut Algorithms for the Equicut Problem ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Global convergence of the alternating projection method for the Max-Cut relaxation problem ⋮ Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs ⋮ Unnamed Item ⋮ New approaches for optimizing over the semimetric polytope ⋮ On the canonical metric representation, average distance, and partial Hamming graphs ⋮ FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES ⋮ Accelerating Fourier–Motzkin elimination using bit pattern trees ⋮ Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes ⋮ The realization problem for tail correlation functions
This page was built for publication: Geometry of cuts and metrics
