Exploiting symmetries in polyhedral computations
From MaRDI portal
Publication:2849003
Abstract: In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some of the future challenges and sketch some directions of potential developments.
Recommendations
Cites work
- scientific article; zbMATH DE number 1645815 (Why is no real title available?)
- scientific article; zbMATH DE number 3874102 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 1786505 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 1859030 (Why is no real title available?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A counterexample to the Hirsch conjecture
- A counterexample to the dominating set conjecture
- A proof of the Kepler conjecture
- Abstract Regular Polytopes
- Algebraic algorithms for sampling from conditional distributions
- Algorithms for highly symmetric linear and integer programs
- C++ tools for exploiting polyhedral symmetries
- Classification algorithms for codes and designs
- Classification of eight-dimensional perfect forms
- Classification of orthogonal arrays by integer programming
- Combinatorial optimization and small polytopes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity and algorithms for computing Voronoi cells of lattices
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Computational geometry of positive definite quadratic forms. Polyhedral reduction theories, algorithms, and applications
- Computing symmetry groups of polyhedra
- Computing the Continuous Discretely
- Convex Polytopes
- Counting lattice points
- Counting linear extensions
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Experimental study of energy-minimizing point configurations on spheres
- Exploiting orbits in symmetric ILP
- Exploiting polyhedral symmetries in social choice
- Exploiting symmetry in integer convex optimization using core points
- Fundamental Domains for Integer Programs with Symmetries
- Generating all vertices of a polyhedron is hard
- How to integrate a polynomial over a simplex
- Improving bounds on the football pool problem by integer programming and high-throughput computing
- Integer Programming with a Fixed Number of Variables
- Integer points in polyhedra
- Linear and Integer Programming vs Linear Integration and Counting
- MathOverflow
- On the Complexity of Computing the Volume of a Polyhedron
- On the complexity of polytope isomorphism problems
- On the face lattice of the metric polytope
- On the integral homology of \(\text{PSL}_4(\mathbb Z)\) and other arithmetic groups
- Optimality and uniqueness of the Leech lattice among lattices
- Orbital branching
- PORTA
- Packing and partitioning orbitopes
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Polyhedral representation conversion up to symmetries
- Probability calculations under the IAC hypothesis
- Reducibility among combinatorial problems
- SCIP: solving constraint integer programs
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- Symmetry in integer linear programming
- Tensor product multiplicities, canonical and totally positive varieties
- The Ehrhart polynomial of the Birkhoff polytope
- The computation of generalized Ehrhart series in normaliz
- The contact polytope of the Leech lattice
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- The many aspects of counting lattice points in polytopes
- The many facets of linear programming
- The strong dodecahedral conjecture and Fejes Tóth's conjecture on sphere packings with kissing number twelve
- Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.
- polymake: a framework for analyzing convex polytopes
Cited in
(9)- Mini-workshop: Exploiting symmetry in optimization. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Local orientation-preserving symmetry preserving operations on polyhedra
- Computing symmetry groups of polyhedra
- An effective solution to convex 1-body \(N\)-representability
- C++ tools for exploiting polyhedral symmetries
- Polyhedral representation conversion up to symmetries
- On the geometry of symmetry breaking inequalities
- On the geometry of symmetry breaking inequalities
Describes a project that uses
Uses Software
This page was built for publication: Exploiting symmetries in polyhedral computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849003)
