Traversing combinatorial 0/1-polytopes via optimization

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Maximum weight independent sets and cliques in intersection graphs of filaments
Greedy flipping of pancakes and burnt pancakes
Efficient oracles for generating binary bubble languages
Binary bubble languages and cool-lex order
The negative cycles polyhedron and hardness of checking some polyhedral properties
Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1,5}\sqrt{m/\log \,n})$
A new algorithm for generation of permutations
Hamiltonicity in (0-1)-polyhedra
Two poset polytopes
Hamiltonicity and combinatorial polyhedra
On-line and off-line vertex enumeration by adjacency lists
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
The vertex set of a $0/1$-polytope is strongly $\mathcal P$-enumerable
Gray codes from antimatroids
On certain polytopes associated with graphs
Recognition algorithms for orders of small width and graphs of small Dilworth number
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Reverse search for enumeration
A Hamilton cycle in the $k$-sided pancake network
A pivot Gray code listing for the spanning trees of the fan graph
The Greedy Gray Code Algorithm
Listing all the minimum spanning trees in an undirected graph
The Complexity of Vertex Enumeration Methods
A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
Finding all minimum-cost perfect matchings in Bipartite graphs
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
On Rotations and the Generation of Binary Trees
Lectures on Polytopes
A Survey of Combinatorial Gray Codes
A minimum spanning tree algorithm with inverse-Ackermann type complexity
A Data Structure for Nearest Common Ancestors with Linking
Scaling Algorithms for Weighted Matching in General Graphs
Proximity Search for Maximal Subgraph Enumeration
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices
0/1 vertex and facet enumeration with BDDs
Max flows in O(nm) time, or better
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Combinatorial generation via permutation languages. I. Fundamentals
Combinatorial optimization. Theory and algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem
Efficient algorithms on distributive lattices
Combinatorial Gray codes -- an updated survey
All your bases are belong to us: listing all bases of a matroid by greedy exchanges

This page was built for publication: Traversing combinatorial 0/1-polytopes via optimization