Pages that link to "Item:Q1771349"
From MaRDI portal
The following pages link to Partial convexification cuts for 0--1 mixed-integer programs (Q1771349):
Displaying 11 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- A branch-and-cut method for 0-1 mixed convex programming (Q1968795) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation (Q3009749) (← links)
- Integer Programming and Combinatorial Optimization (Q5712451) (← links)
