Pages that link to "Item:Q4108138"

The following pages link to Technical Note—Facets and Strong Valid Inequalities for Integer Programs (Q4108138):

Displaying 40 items.

• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
• Lifting, tilting and fractional programming revisited (Q614041) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← 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)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
• Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
• A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
• Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
• On tightening cover induced inequalities (Q1199516) (← links)
• Cutting planes for integer programs with general integer variables (Q1290616) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• On a generalization of the master cyclic group polyhedron (Q1960187) (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
• The project scheduling polyhedron: Dimension, facets and lifting theorems (Q2367366) (← links)
• A cutting plane method for knapsack polytope (Q2391714) (← links)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
• Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
• Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable (Q2815436) (← links)
• Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
• Lifting the facets of zero–one polytopes (Q3865839) (← links)
• Sequence independent lifting of cover inequalities (Q5101436) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
• A family of inequalities for the generalized assignment polytope (Q5949919) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
• Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
• Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)
• Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)