Modeling combinatorial disjunctive constraints via junction trees

DOI10.1007/s10107-023-01955-3arXiv2205.06916MaRDI QIDQ6120845

Joey Huchette, Bochuan Lyu, Illya V. Hicks

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.06916

zbMATH Keywords

biclique coversjunction treescombinatorial disjunctive constraintsgeneralized special ordered setsplanar obstacle avoidance

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Algorithm for cardinality-constrained quadratic optimization
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Disjunctive programming: Properties of the convex hull of feasible points
• Heuristics for cardinality constrained portfolio optimization
• Elementare Theorie der konvexen Polyeder
• On edge perfectness and classes of bipartite graphs
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• The biclique covering number of grids
• Ideal representations of lexicographic orderings and base-2 expansions of integer variables
• Mixed Integer Linear Programming Formulation Techniques
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
• Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Modelling with integer variables
• Mixed-Integer Representations in Control Design
• Disjunctive Programming
• Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Nonconvex Piecewise Linear Functions: Advanced Formulations and Simple Modeling Tools

This page was built for publication: Modeling combinatorial disjunctive constraints via junction trees