Pages that link to "Item:Q4074671"
From MaRDI portal
The following pages link to Faces for a linear inequality in 0–1 variables (Q4074671):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Implicit cover inequalities (Q266036) (← links)
- On the mixing set with a knapsack constraint (Q291057) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Monotone clutters (Q688257) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- A combinatorial optimization approach to the selection of statistical units (Q747022) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- Second-order cover inequalities (Q927162) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Solving a school bus scheduling problem with integer programming (Q954937) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- A characterization of threshold matroids (Q1144029) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs (Q1237653) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Matroidal relaxations for 0-1 knapsack problems (Q1319682) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- On the linear description of the 3-cycle polytope (Q1600839) (← links)
