Pages that link to "Item:Q2583182"
From MaRDI portal
The following pages link to A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182):
Displaying 7 items.
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
