Pages that link to "Item:Q3470249"
From MaRDI portal
The following pages link to Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization (Q3470249):
Displaying 17 items.
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- Modeling outranking process as a mathematical programming problem (Q908847) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency (Q1194735) (← links)
- Preference voting and project ranking using DEA and cross-evaluation (Q1268429) (← links)
- A new global approach for \(0\)-\(1\) polynomial programs (Q1317077) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- A simple recipe for concise mixed 0-1 linearizations (Q1886797) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems (Q3990570) (← links)
