Pages that link to "Item:Q1977865"

The following pages link to Sequence independent lifting in mixed integer programming (Q1977865):

Displaying 50 items.

• Implicit cover inequalities (Q266036) (← links)
• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets (Q312703) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
• On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
• Maximizing a class of submodular utility functions (Q543403) (← links)
• Lifting, tilting and fractional programming revisited (Q614041) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← 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)
• 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)
• Lifting two-integer knapsack inequalities (Q868448) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← 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)
• Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209) (← links)
• A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
• Constrained integer fractional programming problem with box constraints (Q1689256) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic (Q1734831) (← links)
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
• Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219) (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
• Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
• Multi-period traffic routing in satellite networks (Q1926695) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• On a generalization of the master cyclic group polyhedron (Q1960187) (← links)
• Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← 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)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• The (not so) trivial lifting in two dimensions (Q2281447) (← links)
• On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
• New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
• Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
• Local cuts for mixed-integer programming (Q2392934) (← links)
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
• The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
• Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)