Pages that link to "Item:Q319186"
From MaRDI portal
The following pages link to A practicable branch and bound algorithm for sum of linear ratios problem (Q319186):
Displaying 31 items.
- Outcome space range reduction method for global optimization of sum of affine ratios problem (Q330338) (← links)
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
- Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions (Q824489) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait (Q1753605) (← links)
- Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
- An effective algorithm for globally solving sum of linear ratios problems (Q1794234) (← links)
- An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients (Q1993432) (← links)
- Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem (Q2001124) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- A solution approach for cardinality minimization problem based on fractional programming (Q2168753) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- An outcome space algorithm for minimizing a class of linear ratio optimization problems (Q2245774) (← links)
- A conic relaxation model for searching for the global optimum of network data envelopment analysis (Q2272317) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An effective global optimization algorithm for quadratic programs with quadratic constraints (Q2335092) (← links)
- A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← 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)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Two-level linear relaxation method for generalized linear fractional programming (Q6047583) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem (Q6098133) (← links)
