Some polyhedra related to combinatorial problems
From MaRDI portal
Publication:2535821
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
Related Items (only showing first 100 items - show all)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Maximum matching and a polyhedron with 0,1-vertices
- The Theory and Computation of Knapsack Functions
- A primal (all-integer) integer programming algorithm
- FACES OF AN INTEGER POLYHEDRON
- Synthesis of a Communication Network
This page was built for publication: Some polyhedra related to combinatorial problems
