Solving linear optimization over arithmetic constraint formula
From MaRDI portal
Publication:1675635
DOI10.1007/s10898-017-0499-8zbMath1408.90171OpenAlexW2586228778MaRDI QIDQ1675635
Yinrun Lyu, Nasro Min-Allah, Yongji Wang, Jamal Alhiyafi, Changyou Zhang, Jingzheng Wu, Li Chen, Chong Wang
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0499-8
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A fixed-charge model with fuzzy inequality constraints composed by max-product operator
- Optimization with disjunctive constraints
- Facial disjunctive programs and sequences of cutting-planes
- Logic-based decision support. Mixed integer model formulation
- Disjunctive programming: Properties of the convex hull of feasible points
- Solving fuzzy relation equations with a linear objective function
- A rewriting approach to satisfiability procedures.
- Sequential convexification in reverse convex and disjunctive programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Classification through incremental max-min separability
- Fundamentals of discrete math for computer science. A problem-solving primer
- Fuzzy linear optimization in the presence of the fuzzy relation inequality constraints with max-min composition
- Sequential Quadratic Programming Methods
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- Optimization Modulo Theories with Linear Rational Costs
- Modelling with integer variables
- Solving SAT and SAT Modulo Theories
- Introduction to Interval Analysis
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Simplification by Cooperating Decision Procedures
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- Interior Methods for Nonlinear Optimization
- The MathSAT5 SMT Solver
- Integer Programming: Methods, Uses, Computations
- Symbolic optimization with SMT solvers
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- All of Nonparametric Statistics
- A trust region method based on interior point techniques for nonlinear programming.
This page was built for publication: Solving linear optimization over arithmetic constraint formula
