Pages that link to "Item:Q1572989"
From MaRDI portal
The following pages link to An efficient linearization approach for mixed-integer problems (Q1572989):
Displaying 20 items.
- On the mixed binary goal programming problems (Q706740) (← links)
- Revised multi-choice goal programming (Q838196) (← links)
- On the single item multi-supplier system with variable lead-time, price-quantity discount, and resource constraints (Q861078) (← links)
- Binary fuzzy goal programming (Q869140) (← links)
- On the inventory model with continuous and discrete lead time, backorders and lost sales (Q967881) (← links)
- Linearization of a 0-1 quadratic fractional programming problem (Q998699) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- Mixed integer programming for the 0--1 maximum probability model. (Q1426689) (← links)
- On the posynomial fractional programming problems (Q1848628) (← links)
- A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
- Solving multi-period interdiction via generalized Bender's decomposition (Q2401773) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- Reformulation of the modified goal programming for logarithmic piecewise linear function (Q2490187) (← links)
- Formulating the mixed integer fractional posynomial programming (Q2496065) (← links)
- An acquisition policy for a single item multi-supplier system with real-world constraints (Q2504399) (← links)
- Fractional programming with absolute-value functions: a fuzzy goal programming approach (Q2570728) (← links)
- On the mixed integer signomial programming problems (Q2573603) (← links)
- A seasonal demand inventory model with variable lead time and resource constraints (Q2643395) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Time–cost trade-off in a multi-choice assignment problem (Q6094492) (← links)
