An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
From MaRDI portal
Publication:1753130
DOI10.1007/s10898-017-0602-1zbMath1400.90252OpenAlexW2792891042MaRDI QIDQ1753130
Li Chen, Changyou Zhang, Yinrun Lyu, Dacheng Qu, Nasro Min-Allah, Yongji Wang
Publication date: 25 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0602-1
Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of relaxations for linear generalized disjunctive programming
- An algorithm for solving optimization problems with fuzzy relational inequality constraints
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Solving quantified verification conditions using satisfiability modulo theories
- A structure-preserving clause form translation
- A fixed-charge model with fuzzy inequality constraints composed by max-product operator
- An optimality result for clause form translation
- Disjunctive programming: Properties of the convex hull of feasible points
- Solving fuzzy relation equations with a linear objective function
- Solving linear optimization over arithmetic constraint formula
- Global optimization of disjunctive programs
- Mixed logical-linear programming
- Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max-min composition
- BerkMin: A fast and robust SAT-solver
- Mixed Integer Linear Programming Formulation Techniques
- A Survey of Satisfiability Modulo Theory
- Logic, Optimization, and Constraint Programming
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
- Optimization Modulo Theories with Linear Rational Costs
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
- Symbolic optimization with SMT solvers
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
