Some polyhedra related to combinatorial problems

Cites work

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?)
A primal (all-integer) integer programming algorithm
FACES OF AN INTEGER POLYHEDRON
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)

Minimal inequalities for mixed integer programs
The master equality polyhedron with multiple rows
A geometric approach to cut-generating functions
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
On the knapsack closure of 0-1 integer linear programs
Über die irrednziblen punkte des eckenpolyeders
Intersection cuts from multiple rows: a disjunctive programming approach
Partial hyperplane activation for generalized intersection cuts
Polyhedral annexation in mixed integer and combinatorial programming
Enumerating integer points in polytopes with bounded subdeterminants
Relaxations of mixed integer sets from lattice-free polyhedra
Relaxations of mixed integer sets from lattice-free polyhedra
Automatic Generation of Symmetry-Breaking Constraints
Standard pairs and group relaxations in integer programming
Extended formulations for Gomory corner polyhedra
Integer programming and convex analysis: Intersection cuts from outer polars
Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
A note on the solution of group knapsack problems
Binary group and Chinese postman polyhedra
Can cut-generating functions be good and efficient?
On cutting planes for cardinality-constrained linear programs
Split cuts and extended formulations for mixed integer conic quadratic programming
A probabilistic analysis of the strength of the split and triangle closures
Lifting, tilting and fractional programming revisited
Symmetry in mathematical programming
The value function of a mixed integer program. II
Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
Numerical semigroups, polyhedra, and posets. I: The group cone
Equivalence between intersection cuts and the corner polyhedron
Two-halfspace closure
On the relative strength of different generalizations of split cuts
A new storage reduction technique for the solution of the group problem
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
Foundation-penalty cuts for mixed-integer programs.
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Sensitivity theorems in integer linear programming
Dual row modules and polyhedra of blocking group problems
Vertex structure of master corner polyhedra
Generation of all integer points for given sets of linear inequalities
Two-set inequalities for the binary knapsack polyhedra
Facet of regular 0–1 polytopes
Distance-sparsity transference for vertices of corner polyhedra
Constructive characterizations of the value function of a mixed-integer program. II
Intersection cuts for single row corner relaxations
Discrete subadditive functions as Gomory functions
New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem
A few strong knapsack facets
The worst case analysis of strong knapsack facets
A solution method for a knapsack problem and its variant
On polynomial-time solvable linear Diophantine problems
Chvatal--Gomory--tier cuts for general integer programs
\(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
An algorithm for the separation of two-row cuts
Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
Properties of vertex packing and independence system polyhedra
Primal-dual simplex method for shooting
Subadditive approaches in integer programming
Optimizing two types of discrete functions, subject to linear restrictions
Equivariant perturbation in Gomory and Johnson's infinite group problem. VII: Inverse semigroup theory, closures, decomposition of perturbations
On the facets of mixed integer programs with two integer variables and two constraints
Number of Vertices of the Polytope of Integer Partitions and Factorization of the Partitioned Number
On minimal valid inequalities for mixed integer conic programs
The value function of a mixed integer program: I
Piecewise smooth extreme functions are piecewise linear
On the cycle polytope of a binary matroid
The value function of an integer program
The (not so) trivial lifting in two dimensions
On the facet defining inequalities of the mixed-integer bilinear covering set
Sequence independent lifting of cover inequalities
On the facial structure of set packing polyhedra
Unique lifting of integer variables in minimal inequalities
Non-standard approaches to integer programming
On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\)
Computational experience with a group theoretic integer programming algorithm
The atoms of integer programming
An extension of Hu's group minimization algorithm
On ternary problems
Minimal inequalities
A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
Some continuous functions related to corner polyhedra
Some continuous functions related to corner polyhedra, II
On the extreme inequalities of infinite group problems
Representability in mixed integer programming. I: Characterization results
The b-hull of an integer program
Valid inequalities for mips and group polyhedra from approximate liftings
Relations between facets of low- and high-dimensional group problems
On the strength of Gomory mixed-integer cuts as group cuts
Strengthening lattice-free cuts using non-negativity
Valid inequalities for mixed integer linear programs
A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
Cyclic group blocking polyhedra
Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
Vectors in a box
Strengthening cuts for mixed integer programs
Some Results on Polyhedra of Semigroup Problems
Polyhedra of regular p-nary group problems
Optimal cutting planes from the group relaxations
Integer points on the Gomory fractional cut (hyperplane)

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)