Pages that link to "Item:Q4363673"

The following pages link to Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (Q4363673):

Displaying 50 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
• Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
• Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• A brief history of lift-and-project (Q537586) (← links)
• Revival of the Gomory cuts in the 1990's (Q537587) (← links)
• On the separation of disjunctive cuts (Q543404) (← links)
• Branching on general disjunctions (Q543420) (← links)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• Improved strategies for branching on general disjunctions (Q652284) (← links)
• Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Depth-optimized convexity cuts (Q817181) (← links)
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• Reformulating the disjunctive cut generating linear program (Q827289) (← links)
• MIR closures of polyhedral sets (Q847821) (← links)
• Computing minimal forecast horizons: an integer programming approach (Q853795) (← links)
• Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
• Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
• A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
• Cutting planes for integer programs with general integer variables (Q1290616) (← links)
• A modified lift-and-project procedure (Q1365045) (← links)
• A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
• ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions (Q1578557) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
• Computational study of a family of mixed-integer quadratic programming problems (Q1814787) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Mixed logical-linear programming (Q1961464) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
• An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
• Split cuts from sparse disjunctions (Q2195684) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
• Lift-and-project for general two-term disjunctions (Q2339813) (← links)