The following pages link to Facet of regular 0–1 polytopes (Q4074672):
Displaying 50 items.
- Implicit cover inequalities (Q266036) (← links)
- A polyhedral investigation of star colorings (Q284838) (← 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)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← 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)
- Integer-programming software systems (Q817202) (← 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)
- 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)
- On the completability of incomplete Latin squares (Q966163) (← links)
- Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations (Q1103523) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- A note on the knapsack problem with special ordered sets (Q1168894) (← 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)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs (Q1237653) (← links)
- Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
