Solving linear optimization over arithmetic constraint formula
From MaRDI portal
Publication:1675635
Recommendations
- Solving linear systems involved in constrained optimization
- Solving linear programming problems exactly
- Solving linear programming problems via linear minimax problems
- scientific article; zbMATH DE number 3296899
- Linearly constrained optimization
- scientific article; zbMATH DE number 3912118
- Linear programming with interval arithmetic
- Solving linear programming with constraints unknown
- Optimization problems under (max, min)-linear equations and/or inequality constraints
- scientific article; zbMATH DE number 528888
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- A fixed-charge model with fuzzy inequality constraints composed by max-product operator
- A hierarchy of relaxations for linear generalized disjunctive programming
- A rewriting approach to satisfiability procedures.
- A trust region method based on interior point techniques for nonlinear programming.
- All of Nonparametric Statistics
- An algorithm for solving optimization problems with fuzzy relational inequality constraints
- Classification through incremental max-min separability
- Convex programming for disjunctive convex optimization
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Facial disjunctive programs and sequences of cutting-planes
- 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
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 469135 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- Integer Programming: Methods, Uses, Computations
- Interior Methods for Nonlinear Optimization
- Introduction to Interval Analysis
- Logic-based decision support. Mixed integer model formulation
- Modelling with integer variables
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Optimization modulo theories with linear rational costs
- Optimization with disjunctive constraints
- Real-time system design based on logic OR constrained optimization
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Sequential convexification in reverse convex and disjunctive programming
- Sequential quadratic programming methods
- Simplification by Cooperating Decision Procedures
- Solving fuzzy relation equations with a linear objective function
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Symbolic optimization with SMT solvers
- The MathSAT5 SMT solver
Cited in
(1)
This page was built for publication: Solving linear optimization over arithmetic constraint formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675635)
