The following pages link to Polyhedral combinatorics (Q4871778):
Displaying 20 items.
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Polytopes, permutation shapes and bin packing (Q1398288) (← links)
- A short proof of a theorem of Falmagne. (Q1431817) (← links)
- Counting stable sets on Cartesian products of graphs (Q1584266) (← links)
- Discrete polymatroids (Q1863000) (← links)
- The facets and the symmetries of the approval-voting polytope (Q1880786) (← links)
- An optimal bound to access the core in TU-games (Q2435888) (← links)
- Seven open problems in applied combinatorics (Q2699863) (← links)
- Combinatorics with a geometric flavor (Q2739351) (← links)
- (Q3673576) (← links)
- (Q3677508) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- (Q3801582) (← links)
- (Q3982530) (← links)
- (Q3999543) (← links)
- Combinatorially regular Euler polytopes (Q4363856) (← links)
- (Q4561135) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- Normal Forms and Unfoldings for Local Dynamical Systems (Q4789133) (← links)