Polyhedral annexation in mixed integer and combinatorial programming
From MaRDI portal
Publication:4139972
DOI10.1007/BF01681342zbMATH Open0364.90073OpenAlexW2082948434MaRDI QIDQ4139972FDOQ4139972
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01681342
Integer programming (90C10) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Some polyhedra related to combinatorial problems
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- Title not available (Why is that?)
- A tree-search algorithm for mixed integer programming problems
- Title not available (Why is that?)
- Integer programming and convex analysis: Intersection cuts from outer polars
- Trivial integer programs unsolvable by branch-and-bound
- Cutting-planes for programs with disjunctive constraints
- Polyhedral convexity cuts and negative edge extensions
- The Generalized Lattice-Point Problem
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Convexity Cuts and Cut Search
- Convexity cuts for multiple choice problems
- The Disjunctive-Facet Problem: Formulation and Solution Techniques
- Polaroids: A new tool in non‐convex and in integer programming
- Inequalities for mixed integer programs with structure
- Convex and polaroid extensions
- Enumerative Cuts: I
Cited In (14)
- A note on duality in disjunctive programming
- A converse for disjunctive constraints
- Minimal inequalities
- A finitely convergent procedure for facial disjunctive programs
- Representability in mixed integer programming. I: Characterization results
- 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
- Representability of functions
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Relaxations for probabilistically constrained programs with discrete random variables
- Optimality conditions for disjunctive optimization in reflexive Banach spaces
- A simplification for some disjunctive formulations
- Foundation-penalty cuts for mixed-integer programs.
This page was built for publication: Polyhedral annexation in mixed integer and combinatorial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139972)
