The following pages link to (Q4132247):
Displaying 25 items.
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Duality in disjunctive linear fractional programming (Q1059557) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- A converse for disjunctive constraints (Q1238749) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions (Q1761858) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Representability of functions (Q1825755) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
