Pages that link to "Item:Q2557712"
From MaRDI portal
The following pages link to Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712):
Displaying 50 items.
- Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
- Discrete extremal problems (Q1152306) (← links)
- On total dual integrality (Q1159081) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Circuits in graphs embedded on the torus (Q1199633) (← links)
- A note on symmetric doubly-stochastic matrices (Q1219934) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- On surrogating 0-1 knapsack constraints (Q1304781) (← links)
- A primal dual integer programming algorithm (Q1309813) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Totally tight Chvatal-Gomory cuts (Q1612006) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
- Kernels by properly colored paths in arc-colored digraphs (Q1744736) (← links)
- On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Integer programming as projection (Q1751196) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← links)
- A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank (Q1801017) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- Deterministic network interdiction (Q1804095) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Constructing the value function for an integer linear programme over a cone (Q1918916) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets (Q2064297) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- Computing the integer hull of convex polyhedral sets (Q2109987) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- On disks of the triangular grid: an application of optimization theory in discrete geometry (Q2185738) (← links)