Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
From MaRDI portal
Recommendations
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- ``Miniaturized linearizations for quadratic 0/1 problems
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Linear Reformulations of Integer Quadratic Programs
Cited in
(17)- A linearization framework for unconstrained quadratic (0-1) problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- An enhanced logarithmic method for signomial programming with discrete variables
- A simple recipe for concise mixed 0-1 linearizations
- Preference voting and project ranking using DEA and cross-evaluation
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Mixed integer linear programming formulation techniques
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- A new global approach for \(0\)-\(1\) polynomial programs
- An efficient linearization approach for mixed-integer problems
- Modeling outranking process as a mathematical programming problem
- Solving multi-period interdiction via generalized Bender's decomposition
- Linear forms of nonlinear expressions: new insights on old ideas
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
- ``Miniaturized linearizations for quadratic 0/1 problems
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
This page was built for publication: Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470249)
