Some polyhedra related to combinatorial problems

Cites work

A primal (all-integer) integer programming algorithm
FACES OF AN INTEGER POLYHEDRON
scientific article; zbMATH DE number 3211372 (Why is no real title available?)
scientific article; zbMATH DE number 3373541 (Why is no real title available?)
scientific article; zbMATH DE number 3058859 (Why is no real title available?)
Maximum matching and a polyhedron with 0,1-vertices
ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
Synthesis of a Communication Network
The Theory and Computation of Knapsack Functions

Cited in

(only showing first 100 items - show all)

Valid inequalities for mips and group polyhedra from approximate liftings
Stable sets, corner polyhedra and the Chvàtal closure
Constructive characterizations of the value function of a mixed-integer program. II
On the cycle polytope of a binary matroid
Representability in mixed integer programming. I: Characterization results
Polyhedra of regular p-nary group problems
On ternary problems
Strengthening cuts for mixed integer programs
The b-hull of an integer program
Optimal cocircuits in regular matroids and applications
Optimizing two types of discrete functions, subject to linear restrictions
The value function of a mixed integer program: I
A necessary and sufficient condition for the aggregation of linear Diophantine equations
An extension of Hu's group minimization algorithm
Minimal inequalities for mixed integer programs
Cutting-plane theory: Algebraic methods
The value function of a mixed integer program. II
Standard pairs and group relaxations in integer programming
Foundation-penalty cuts for mixed-integer programs.
Integer programming, Barvinok's counting algorithm and Gomory relaxations.
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
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. VI: The curious case of two-sided discontinuous minimal valid functions
Chvatal--Gomory--tier cuts for general integer programs
Split cuts and extended formulations for mixed integer conic quadratic programming
On the lattice programming gap of the group problems
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
Exponents of tuples of nonnegative matrices
Exponents of nonnegative matrix pairs
Cyclic group blocking polyhedra
On a generalization of the master cyclic group polyhedron
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
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
Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
Partial hyperplane activation for generalized intersection cuts
Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
On the facet defining inequalities of the mixed-integer bilinear covering set
A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
The (not so) trivial lifting in two dimensions
Piecewise smooth extreme functions are piecewise linear
FPT-algorithm for computing the width of a simplex given by a convex hull
On cutting planes for cardinality-constrained linear programs
On polynomial-time solvable linear Diophantine problems
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
Generating functions and duality for integer programs
Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
On the facets of mixed integer programs with two integer variables and two constraints
When the Gomory-chvátal closure coincides with the integer hull
\(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
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Valid inequalities based on the interpolation procedure
Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
The strength of multi-row models
On the asymptotic integer algorithm
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
Two-halfspace closure
On minimal valid inequalities for mixed integer conic programs
The Chvátal closure of generalized stable sets in bidirected graphs
Vertex structure of master corner polyhedra
On the knapsack closure of 0-1 integer linear programs
Primal-dual simplex method for shooting
Symmetry in mathematical programming
A probabilistic analysis of the strength of the split and triangle closures
A solution method for a knapsack problem and its variant
On integer programming with bounded determinants
Origin and early evolution of corner polyhedra
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
Über die irrednziblen punkte des eckenpolyeders
Mappings and Facets for Nonabelian Group Problems
Binary group and Chinese postman polyhedra
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Dual row modules and polyhedra of blocking group problems
Unique lifting of integer variables in minimal inequalities
Sensitivity theorems in integer linear programming
A Sharp Bound for Solutions of Linear Diophantine Equations
Minimal inequalities
Integer programming duality: Price functions and sensitivity analysis
Polyhedral polarity defined by a general bilinear inequality
The value function of an integer program
A new storage reduction technique for the solution of the group problem
Some Results on Polyhedra of Semigroup Problems
A note on the solution of group knapsack problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535821)