Pages that link to "Item:Q2572656"
From MaRDI portal
The following pages link to A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656):
Displaying 20 items.
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- A global optimization algorithm for sum of linear ratios problem (Q364313) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Global optimization of generalized linear fractional programming with nonlinear constraints (Q865505) (← links)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- Global optimization for sum of linear ratios problem using new pruning technique (Q1023182) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems (Q2399489) (← links)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)