Pages that link to "Item:Q2364779"

The following pages link to A new branch and bound algorithm for minimax ratios problems (Q2364779):

Displaying 7 items.

• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
• An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
• (Q4928051) (← links)
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
• Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← links)
• A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (Q6569145) (← links)
• A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)