Pages that link to "Item:Q598594"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for maximizing the sum of several linear ratios (Q598594):
Displaying 20 items.
- Global optimization for sum of linear ratios problem with coefficients (Q2493767) (← links)
- A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Effective algorithm and computational complexity for solving sum of linear ratios problem (Q2691389) (← links)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- (Q3384769) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- (Q4928051) (← links)
- (Q5197109) (← links)
- A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points (Q5232839) (← links)
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Global optimization of nonlinear sums of ratios (Q5955588) (← links)
- Global optimization algorithm for the nonlinear sum of ratios problem (Q5959898) (← links)
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming (Q5964247) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)