Convexity Cuts and Cut Search
From MaRDI portal
Publication:5679924
DOI10.1287/opre.21.1.123zbMath0263.90020OpenAlexW2130335038MaRDI QIDQ5679924
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.123
Related Items
Maximal Quadratic-Free Sets, A lift-and-project cutting plane algorithm for mixed 0-1 programs, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Monoidal strengthening and unique lifting in MIQCPs, Cut search methods in integer programming, Enumerative inequalities in integer programming, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Integer programming and convex analysis: Intersection cuts from outer polars, A simplex procedure for linear programs with some 0-1 integer constraints, Relaxations for probabilistically constrained programs with discrete random variables, Optimization of linear-convex programs, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Improved convexity cuts for lattice point problems, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Bilinear programming: An exact algorithm, Polyhedral annexation in mixed integer and combinatorial programming, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Large-scale 0-1 linear programming on distributed workstations, Cutting-planes for programs with disjunctive constraints, On cutting planes for cardinality-constrained linear programs, Convergence of a subgradient method for computing the bound norm of matrices, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Stability in disjunctive optimization II:continuity of the feasible and optimal set, Polyhedral convexity cuts and negative edge extensions, Maximal quadratic-free sets, Depth-optimized convexity cuts
