Some polyhedra related to combinatorial problems

DOI10.1016/0024-3795(69)90017-2zbMath0184.23103OpenAlexW2065803772MaRDI QIDQ2535821

Publication date: 1969

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(69)90017-2

zbMATH Keywords

operations research

Related Items

On the cycle polytope of a binary matroid, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Intersection cuts for single row corner relaxations, Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity, Representability in mixed integer programming. I: Characterization results, Subadditive approaches in integer programming, A concise characterization of strong knapsack facets, On integer programming with bounded determinants, On the extreme inequalities of infinite group problems, Origin and early evolution of corner polyhedra, Extended formulations for Gomory corner polyhedra, Generating functions and duality for integer programs, Theoretical challenges towards cutting-plane selection, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, On the facets of mixed integer programs with two integer variables and two constraints, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Lifting two-integer knapsack inequalities, Mixed-integer cuts from cyclic groups, The structure of the infinite models in integer programming, Polyhedra of regular p-nary group problems, On ternary problems, Partial hyperplane activation for generalized intersection cuts, Unique lifting of integer variables in minimal inequalities, Lifting, tilting and fractional programming revisited, When the Gomory-chvátal closure coincides with the integer hull, Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, Strengthening cuts for mixed integer programs, Lifting properties of maximal lattice-free polyhedra, \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set, The master equality polyhedron with multiple rows, The b-hull of an integer program, On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets, Strengthening lattice-free cuts using non-negativity, Cyclic group blocking polyhedra, A 3-slope theorem for the infinite relaxation in the plane, Foundation-penalty cuts for mixed-integer programs., An algorithm for the separation of two-row cuts, Integer programming, Barvinok's counting algorithm and Gomory relaxations., How tight is the corner relaxation? Insights gained from the stable set problem, Optimal cocircuits in regular matroids and applications, On a generalization of the master cyclic group polyhedron, Intersection cuts from multiple rows: a disjunctive programming approach, On the facet defining inequalities of the mixed-integer bilinear covering set, Binary group facets with complete support and non-binary coefficients, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Sufficiency of cut-generating functions, A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models, On the strength of Gomory mixed-integer cuts as group cuts, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, How tight is the corner relaxation?, The worst case analysis of strong knapsack facets, On the relative strength of different generalizations of split cuts, Duality for a \(b\)-complementary multisemigroup master problem, Intersection cuts for convex mixed integer programs from translated cones, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, Relations between facets of low- and high-dimensional group problems, The atoms of integer programming, Non-standard approaches to integer programming, Valid inequalities based on the interpolation procedure, Equivalence between intersection cuts and the corner polyhedron, Vectors in a box, Chvatal--Gomory--tier cuts for general integer programs, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, Optimizing two types of discrete functions, subject to linear restrictions, Split cuts and extended formulations for mixed integer conic quadratic programming, On the lattice programming gap of the group problems, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, The value function of a mixed integer program: I, The (not so) trivial lifting in two dimensions, Valid inequalities for mixed integer linear programs, A necessary and sufficient condition for the aggregation of linear Diophantine equations, Piecewise smooth extreme functions are piecewise linear, The strength of multi-row models, An extension of Hu's group minimization algorithm, Minimal inequalities for mixed integer programs, Cutting-plane theory: Algebraic methods, Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation, The value function of a mixed integer program. II, Valid inequalities for mips and group polyhedra from approximate liftings, On the asymptotic integer algorithm, On the complexity of surrogate and group relaxation for integer linear programs, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, FPT-algorithm for computing the width of a simplex given by a convex hull, Stable sets, corner polyhedra and the Chvàtal closure, Polytopes of partitions of numbers, Standard pairs and group relaxations in integer programming, On cutting planes for cardinality-constrained linear programs, On polynomial-time solvable linear Diophantine problems, Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Constructive characterizations of the value-function of a mixed-integer program. I, Exponents of tuples of nonnegative matrices, Valid inequalities based on simple mixed-integer sets, Constructive characterizations of the value function of a mixed-integer program. II, A geometric approach to cut-generating functions, Exponents of nonnegative matrix pairs, Cover and pack inequalities for (mixed) integer programming, Light on the infinite group relaxation. I: Foundations and taxonomy, Primal-dual simplex method for shooting, Some Results on Polyhedra of Semigroup Problems, Symmetry in Mathematical Programming, Numerical semigroups, polyhedra, and posets I: the group cone, A note on the solution of group knapsack problems, Binary group and Chinese postman polyhedra, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, Multirow Intersection Cuts Based on the Infinity Norm, Discrete subadditive functions as Gomory functions, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Sequence independent lifting of cover inequalities, Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number, Coordination of manufacturing and engineering activities during product transitions, A few strong knapsack facets, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles, Integer points on the Gomory fractional cut (hyperplane), Optimal Cutting Planes from the Group Relaxations, Some continuous functions related to corner polyhedra, Dual row modules and polyhedra of blocking group problems, Two-halfspace closure, Some continuous functions related to corner polyhedra, II, Generation of all integer points for given sets of linear inequalities, Computational experience with a group theoretic integer programming algorithm, Integer programming and convex analysis: Intersection cuts from outer polars, Sensitivity theorems in integer linear programming, Improved integer programming bounds using intersections of corner polyhedra, Facet of regular 0–1 polytopes, Can Cut-Generating Functions Be Good and Efficient?, Relaxations of mixed integer sets from lattice-free polyhedra, Distance-Sparsity Transference for Vertices of Corner Polyhedra, Approximation of Corner Polyhedra with Families of Intersection Cuts, Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case, Approximate and exact merging of knapsack constraints with cover inequalities, Vertex Structure of Master Corner Polyhedra, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, Lattice Reformulation Cuts, Some computationally relevant group theoretic structures of fixed charge problems, A solution method for a knapsack problem and its variant, Shortest path algorithms for knapsack type problems, Relaxations of mixed integer sets from lattice-free polyhedra, A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound, Unnamed Item, On the facial structure of set packing polyhedra, Polyhedral annexation in mixed integer and combinatorial programming, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Minimal inequalities, On Minimal Valid Inequalities for Mixed Integer Conic Programs, IFORS' Operational Research Hall of Fame, On Four Problems in Graph Theory, Integer programming duality: Price functions and sensitivity analysis, The Chvátal closure of generalized stable sets in bidirected graphs, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Automatic Generation of Symmetry-Breaking Constraints, Cut-Generating Functions and S-Free Sets, Polyhedral polarity defined by a general bilinear inequality, The value function of an integer program, A Sharp Bound for Solutions of Linear Diophantine Equations, Über die irrednziblen punkte des eckenpolyeders, Properties of vertex packing and independence system polyhedra, Mappings and Facets for Nonabelian Group Problems, A new storage reduction technique for the solution of the group problem

Cites Work