Some continuous functions related to corner polyhedra
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- On degenerate multi-row Gomory cuts
- Valid inequalities for mips and group polyhedra from approximate liftings
- General purpose heuristics for integer programming. I
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- Intersection cuts for single row corner relaxations
- A concise characterization of strong knapsack facets
- Theoretical challenges towards cutting-plane selection
- New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
- Some cut-generating functions for second-order conic sets
- Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions
- Constructing general dual-feasible functions
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- Generalized intersection cuts and a new cut generating paradigm
- On a generalization of the master cyclic group polyhedron
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
- The aggregation closure is polyhedral for packing and covering integer programs
- Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations
- Maximal quadratic-free sets
- Partial hyperplane activation for generalized intersection cuts
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- The (not so) trivial lifting in two dimensions
- Piecewise smooth extreme functions are piecewise linear
- An extreme function which is nonnegative and discontinuous everywhere
- A geometric approach to cut-generating functions
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Subadditive approaches in integer programming
- Extended formulations for Gomory corner polyhedra
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- On the facets of mixed integer programs with two integer variables and two constraints
- Structure and interpretation of dual-feasible functions
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- The master equality polyhedron with multiple rows
- A 3-slope theorem for the infinite relaxation in the plane
- An algorithm for the separation of two-row cuts
- Binary group facets with complete support and non-binary coefficients
- Valid inequalities based on the interpolation procedure
- The strength of multi-row models
- Polytopes of partitions of numbers
- Valid inequalities based on simple mixed-integer sets
- Two row mixed-integer cuts via lifting
- Mixed-integer sets from two rows of two adjacent simplex bases
- On minimal valid inequalities for mixed integer conic programs
- Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond
- Cut-generating functions for integer variables
- Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems
- On the knapsack closure of 0-1 integer linear programs
- On sublinear inequalities for mixed integer conic programs
- Origin and early evolution of corner polyhedra
- Computing with Multi-row Gomory Cuts
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Mappings and Facets for Nonabelian Group Problems
- Unique lifting of integer variables in minimal inequalities
- Minimal inequalities
- Characterization of facets for multiple right-hand choice linear programs
- Integer programming duality: Price functions and sensitivity analysis
- The value function of an integer program
- Improved integer programming bounds using intersections of corner polyhedra
- Some computationally relevant group theoretic structures of fixed charge problems
- Polyhedral annexation in mixed integer and combinatorial programming
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- A counterexample to a conjecture of Gomory and Johnson
- Can cut-generating functions be good and efficient?
- Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case
- Sufficiency of cut-generating functions
- Maximal quadratic-free sets
- Optimal cutting planes from the group relaxations
- The worst case analysis of strong knapsack facets
- Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
- Cut-generating functions and S-free sets
- Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\)
- A few strong knapsack facets
- My experiences as a student and researcher in OR during the 1960's and 70's
- Approximation of minimal functions by extreme functions
- On the exact separation of mixed integer knapsack cuts
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- Enumerative inequalities in integer programming
- Some continuous functions related to corner polyhedra, II
- Computational experience with a group theoretic integer programming algorithm
- IFORS' Operational Research Hall of Fame
- On the implementation and strengthening of intersection cuts for QCQPs
- Lifting convex inequalities for bipartite bilinear programs
- On the implementation and strengthening of intersection cuts for QCQPs
- Lifting convex inequalities for bipartite bilinear programs
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Coordination of manufacturing and engineering activities during product transitions
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- Non-standard approaches to integer programming
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts
- On the extreme inequalities of infinite group problems
- Mixed-integer cuts from cyclic groups
- Lifting properties of maximal lattice-free polyhedra
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- On the strength of Gomory mixed-integer cuts as group cuts
- How tight is the corner relaxation?
- Relations between facets of low- and high-dimensional group problems
- Computing with multi-row gomory cuts
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Valid inequalities for mixed integer linear programs
This page was built for publication: Some continuous functions related to corner polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659338)
