Exploiting Symmetries in Polyhedral Computations
From MaRDI portal
Publication:2849003
DOI10.1007/978-3-319-00200-2_15zbMath1273.90127arXiv1406.5281OpenAlexW1550959500MaRDI QIDQ2849003
Publication date: 13 September 2013
Published in: Discrete Geometry and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.5281
symmetryinteger linear programmingEhrhart theoryvolume computationsrepresentation conversionpolyhedral computations
Integer programming (90C10) Lattice points in specified regions (11P21) Polytopes and polyhedra (52B99)
Related Items
An effective solution to convex 1-body \(N\)-representability, On the geometry of symmetry breaking inequalities, On the geometry of symmetry breaking inequalities, Computing symmetry groups of polyhedra
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PORTA
- MathOverflow
- A counterexample to the Hirsch conjecture
- The computation of generalized Ehrhart series in normaliz
- The contact polytope of the Leech lattice
- Orbital branching
- Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.
- On the integral homology of \(\text{PSL}_4(\mathbb Z)\) and other arithmetic groups
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- SCIP: solving constraint integer programs
- Classification algorithms for codes and designs
- Packing and partitioning orbitopes
- Integer points in polyhedra
- Optimality and uniqueness of the Leech lattice among lattices
- Counting linear extensions
- Permutation group algorithms based on partitions. I: Theory and algorithms
- On the complexity of polytope isomorphism problems
- The Ehrhart polynomial of the Birkhoff polytope
- Exploiting orbits in symmetric ILP
- Tensor product multiplicities, canonical and totally positive varieties
- Algebraic algorithms for sampling from conditional distributions
- Combinatorial optimization and small polytopes
- The many facets of linear programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Algorithms for highly symmetric linear and integer programs
- Exploiting symmetry in integer convex optimization using core points
- Exploiting polyhedral symmetries in social choice
- A counterexample to the dominating set conjecture
- Probability calculations under the IAC hypothesis
- Classification of orthogonal arrays by integer programming
- The many aspects of counting lattice points in polytopes
- A proof of the Kepler conjecture
- Computing symmetry groups of polyhedra
- The Strong Dodecahedral Conjecture and Fejes Tóth’s Conjecture on Sphere Packings with Kissing Number Twelve
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- Integer Programming with a Fixed Number of Variables
- Complexity and algorithms for computing Voronoi cells of lattices
- How to integrate a polynomial over a simplex
- Counting lattice points
- Experimental Study of Energy-Minimizing Point Configurations on Spheres
- Computing the Continuous Discretely
- Classification of eight-dimensional perfect forms
- Symmetry in Integer Linear Programming
- Fundamental Domains for Integer Programs with Symmetries
- On the Complexity of Computing the Volume of a Polyhedron
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- Convex Polytopes
- Abstract Regular Polytopes
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Reducibility among Combinatorial Problems
- Linear and Integer Programming vs Linear Integration and Counting
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- C++ Tools for Exploiting Polyhedral Symmetries
- Discrete and Computational Geometry
- Generating all vertices of a polyhedron is hard
