Pages that link to "Item:Q3762334"
From MaRDI portal
The following pages link to Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra (Q3762334):
Displaying 17 items.
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On the completability of incomplete Latin squares (Q966163) (← links)
- On the stable set polytope of a series-parallel graph (Q1106858) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Facets of the independent set polytope (Q1424284) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization (Q2046309) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
- Transitive packing (Q4645940) (← links)
- Odd Cycle Transversals and Independent Sets in Fullerene Graphs (Q4899070) (← links)
- (Q5708566) (← links)
