On the facets of combinatorial polytopes
From MaRDI portal
Publication:3133216
DOI10.1007/978-3-319-44914-2_19zbMATH Open1392.90098OpenAlexW2557288725MaRDI QIDQ3133216FDOQ3133216
Authors: R. Yu. Simanchev, I. V. Urazova 
Publication date: 13 February 2018
Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_19
Recommendations
- On facet-inducing inequalities for combinatorial polytopes
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- Facet generating techniques
- A necessary condition for facetness of comb inequalities for a polytope of connected \(2k\)-factors
- Facets of the \(k\)-partition polytope
Cited In (16)
- A necessary condition for facetness of comb inequalities for a polytope of connected \(2k\)-factors
- Enumeration of the facets of cut polytopes over some highly symmetric graphs
- On affine reducibility of combinatorial polytopes
- Title not available (Why is that?)
- On Faces of Quasi-arithmetic Coxeter Polytopes
- Title not available (Why is that?)
- Facets of the polytope of legal sequences
- Title not available (Why is that?)
- An analog of the Cook theorem for polytopes
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
- On combinatorial and affine automorphisms of polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A combinatorial proof of the cyclic sieving phenomenon for faces of coxeterhedra
- On facet-inducing inequalities for combinatorial polytopes
- Title not available (Why is that?)
This page was built for publication: On the facets of combinatorial polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133216)
