Cutting-planes for programs with disjunctive constraints

DOI10.1007/BF00934290zbMATH Open0238.90044OpenAlexW2149830595MaRDI QIDQ2553385FDOQ2553385

Authors: Guillermo Owen 

Publication date: 1973

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934290

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Cites Work

• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Title not available (Why is that?)
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Convexity Cuts and Cut Search

Cited In (12)

• A note on duality in disjunctive programming
• A converse for disjunctive constraints
• Two mixed integer programming formulations arising in manufacturing management
• Stability in disjunctive optimization II:continuity of the feasible and optimal set
• Strengthening cuts for mixed integer programs
• Facet inequalities from simple disjunctions in cutting plane theory
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Disjunctive programming: Properties of the convex hull of feasible points
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Polyhedral annexation in mixed integer and combinatorial programming
• A strong duality theorem for the minimum of a family of convex programs
• Branch-and-cut for linear programs with overlapping SOS1 constraints

This page was built for publication: Cutting-planes for programs with disjunctive constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553385)