Pages that link to "Item:Q2557712"
From MaRDI portal
The following pages link to Edmonds polytopes and a hierarchy of combinatorial problems (Q2557712):
Displayed 50 items.
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- A finitely converging cutting plane technique (Q1060961) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem) (Q1084400) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- Comments on practical implementation of Gomory's fractional algorithm (Q1134628) (← links)
- 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)
- Chvatal--Gomory--tier cuts for general integer programs (Q1779688) (← 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)