Pages that link to "Item:Q5739134"
From MaRDI portal
The following pages link to Linear Reformulation of Polynomial Discrete Programming for Fast Computation (Q5739134):
Displaying 10 items.
- An enhanced logarithmic method for signomial programming with discrete variables (Q1752141) (← links)
- A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions (Q1941533) (← links)
- An optimization approach for winner determination problem considering transportation cost discounts (Q2046272) (← links)
- Linearization technique with superior expressions for centralized planning problem with discount policy (Q2137652) (← links)
- Alternative solution algorithm for winner determination problem with quantity discount of transportation service procurement (Q2164069) (← 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)
- An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement (Q6195025) (← links)