Pages that link to "Item:Q4909117"
From MaRDI portal
The following pages link to Base-2 Expansions for Linearizing Products of Functions of Discrete Variables (Q4909117):
Displaying 16 items.
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- A note on linearized reformulations for a class of bilevel linear integer problems (Q1730617) (← links)
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- An optimization approach for winner determination problem considering transportation cost discounts (Q2046272) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
