Pages that link to "Item:Q5659338"
From MaRDI portal
The following pages link to Some continuous functions related to corner polyhedra (Q5659338):
Displaying 50 items.
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- Subadditive approaches in integer programming (Q2371344) (← links)
- Extended formulations for Gomory corner polyhedra (Q2386199) (← links)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (Q2390995) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- Structure and interpretation of dual-feasible functions (Q2413164) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- The master equality polyhedron with multiple rows (Q2429471) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- An algorithm for the separation of two-row cuts (Q2436649) (← links)
- Binary group facets with complete support and non-binary coefficients (Q2450757) (← links)
- Valid inequalities based on the interpolation procedure (Q2490327) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Polytopes of partitions of numbers (Q2567201) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Two row mixed-integer cuts via lifting (Q2638372) (← links)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
- Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond (Q2819232) (← links)
- Cut-generating functions for integer variables (Q2833108) (← links)
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems (Q2835688) (← links)
- On the knapsack closure of 0-1 integer linear programs (Q2861491) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles (Q3503866) (← links)
- Mappings and Facets for Nonabelian Group Problems (Q3686430) (← links)
- Minimal inequalities (Q3879045) (← links)
- Characterization of facets for multiple right-hand choice linear programs (Q3896844) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- The value function of an integer program (Q3941194) (← links)
- Improved integer programming bounds using intersections of corner polyhedra (Q4074667) (← links)
- Some computationally relevant group theoretic structures of fixed charge problems (Q4114962) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case (Q4637826) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case (Q5245017) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
- A few strong knapsack facets (Q5351614) (← links)
- Approximation of Minimal Functions by Extreme Functions (Q5376455) (← links)
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints (Q5458539) (← links)
- Enumerative inequalities in integer programming (Q5665019) (← links)
- Some continuous functions related to corner polyhedra, II (Q5668246) (← links)
- Computational experience with a group theoretic integer programming algorithm (Q5671787) (← links)
- IFORS' Operational Research Hall of Fame (Q5898264) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
