The following pages link to Convexity Cuts and Cut Search (Q5679924):
Displaying 26 items.
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A simplex procedure for linear programs with some 0-1 integer constraints (Q1160561) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Improved convexity cuts for lattice point problems (Q1218339) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- Cutting-planes for programs with disjunctive constraints (Q2553385) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Optimization of linear-convex programs (Q3835613) (← links)
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron (Q4136974) (← links)
- Bilinear programming: An exact algorithm (Q4138491) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
- Polyhedral convexity cuts and negative edge extensions (Q4777060) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Cut search methods in integer programming (Q5661707) (← links)
- Enumerative inequalities in integer programming (Q5665019) (← links)
- Integer programming and convex analysis: Intersection cuts from outer polars (Q5675140) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
