Lifts for Voronoi cells of lattices (Q6050227): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00454-023-00522-z / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168387142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice problems in NP ∩ coNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Matroids Have Polynomial Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small extended formulations for cyclic polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zonotopes, dicings, and Voronoi's conjecture on parallelohedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest compact formulation for the permutahedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equidistribution of Hecke points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Independent Set Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension complexity and realization spaces of hypersimplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex and Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear systems with integral valued solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact representations of Voronoi cells of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that the extension complexity of the correlation polytope grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi and Delaunay cells of root lattices: classification of their faces and facets by Coxeter-Dynkin diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of root lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some \(0/1\) polytopes need exponential size extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mean value theorem in geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00454-023-00522-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:58, 30 December 2024

scientific article; zbMATH DE number 7748812
Language Label Description Also known as
English
Lifts for Voronoi cells of lattices
scientific article; zbMATH DE number 7748812

    Statements

    Lifts for Voronoi cells of lattices (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    lattices
    0 references
    Voronoi cells
    0 references
    extended formulations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references