Pages that link to "Item:Q2535821"
From MaRDI portal
The following pages link to Some polyhedra related to combinatorial problems (Q2535821):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- On integer programming with bounded determinants (Q315478) (← links)
- Origin and early evolution of corner polyhedra (Q323202) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- The worst case analysis of strong knapsack facets (Q517314) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) (Q526839) (← links)
- The atoms of integer programming (Q537595) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Vectors in a box (Q715080) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- On the extreme inequalities of infinite group problems (Q847827) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- Lifting properties of maximal lattice-free polyhedra (Q896280) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions (Q992583) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- On ternary problems (Q1121787) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- The b-hull of an integer program (Q1151337) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Optimizing two types of discrete functions, subject to linear restrictions (Q1234633) (← links)
- The value function of a mixed integer program: I (Q1241180) (← links)
- A necessary and sufficient condition for the aggregation of linear Diophantine equations (Q1244170) (← links)
- An extension of Hu's group minimization algorithm (Q1254946) (← links)
- Minimal inequalities for mixed integer programs (Q1254947) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- The value function of a mixed integer program. II (Q1258688) (← links)
- Standard pairs and group relaxations in integer programming (Q1295785) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
