Pages that link to "Item:Q1411611"
From MaRDI portal
The following pages link to A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming (Q1411611):
Displaying 44 items.
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- A note on the MIR closure and basic relaxations of polyhedra (Q635512) (← links)
- Depth-optimized convexity cuts (Q817181) (← 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 deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Modelling either-or relations in integer programming (Q1026568) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- On the relative strength of different generalizations of split cuts (Q1751106) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Characterizing acyclic graphs by labeling edges (Q2448884) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
