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.
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Facets from gadgets (Q2220662) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- Tactical optimization of the oil palm agribusiness supply chain (Q2285344) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- Cutting to the chase. (Q2351157) (← links)
- A note on quasi-kernels in digraphs (Q2353656) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Optimal placement of stereo sensors (Q2465570) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Duality in mathematics and linear and integer programming (Q2565013) (← links)
- Small Chvátal rank (Q2638380) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Two-halfspace closure (Q2689824) (← links)
- The cutting plane method is polynomial for perfect matchings (Q2800362) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- A lower bound on the Chvátal-rank of antiwebs (Q2840740) (← links)
- On the Chvàtal-rank of antiwebs (Q2883565) (← links)
- Rank of random half-integral polytopes. Extended abstract (Q2883588) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
- On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank (Q3186511) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)