Pages that link to "Item:Q319186"
From MaRDI portal
The following pages link to A practicable branch and bound algorithm for sum of linear ratios problem (Q319186):
Displaying 10 items.
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait (Q1753605) (← links)
- Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
