Pages that link to "Item:Q2743661"
From MaRDI portal
The following pages link to Solving sum-of-ratios fractional programs using efficient points (Q2743661):
Displaying 19 items.
- Probabilistic subproblem selection in branch-and-bound algorithms (Q557739) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs (Q711696) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- A sequential method for a class of pseudoconcave fractional problems (Q940830) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- On solving the sum-of-ratios problem (Q2422872) (← links)
- Solving sum of ratios fractional programs via concave minimization (Q2465451) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
- Determining the optimal allocation of testing resource for modular software system using dynamic programming (Q2807715) (← links)
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems (Q2810107) (← links)
- Allocation policy for testing effort of modular software system under budgetary constraint (Q3020610) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- On maximizing the adoption of multi-products in multiple market segments (Q5437801) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
- An algorithm for stochastic convex-concave fractional programs with applications to production efficiency and equitable resource allocation (Q6586226) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)
