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.
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution (Q336705) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Hooked on IP (Q537605) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- 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)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- On matroid parity and matching polytopes (Q777400) (← 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)
- On the pseudo-periodicity of the integer hull of parametric convex polygons (Q831988) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- MIR closures of polyhedral sets (Q847821) (← 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)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← 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)