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 (only showing first 100 items - show all)

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 ⋮ 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.

Cites Work

This page was built for publication: Some polyhedra related to combinatorial problems