Pages that link to "Item:Q3046543"
From MaRDI portal
The following pages link to Fractional programming: The sum-of-ratios case (Q3046543):
Displaying 50 items.
- Anisotropic orthogonal Procrustes analysis (Q263231) (← links)
- Minimizing the sum of many rational functions (Q266410) (← links)
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Approximation of linear fractional-multiplicative problems (Q543418) (← links)
- Global optimization for the generalized polynomial sum of ratios problem (Q548182) (← 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)
- Linear programming system identification (Q706953) (← links)
- Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
- A PTAS for capacitated sum-of-ratios optimization (Q833588) (← links)
- Computing non-dominated solutions in MOLFP (Q877640) (← links)
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
- Practical global optimization for multiview geometry (Q942843) (← links)
- Solving the sum-of-ratios problems by a harmony search algorithm (Q966084) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
- Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← 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)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- A parametric solution method for a generalized fractional programming problem (Q2065366) (← links)
- Solving fuzzy linear fractional set covering problem by a goal programming based solution approach (Q2076450) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Unsupervised quadratic surface support vector machine with application to credit risk assessment (Q2327637) (← links)
- Multicriteria energy policy investments and energy market clearance via integer programming (Q2358157) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications (Q2417051) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- On solving the sum-of-ratios problem (Q2422872) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Enhancing computations of nondominated solutions in MOLFP via reference points (Q2434626) (← links)
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension (Q2450672) (← links)
- Linear programming system identification: the general nonnegative parameters case (Q2456406) (← 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)
- A fast algorithm for globally solving Tikhonov regularized total least squares problem (Q2633538) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- Alternative branching rules for some nonconvex problems (Q2943824) (← links)
- (Q3384769) (← links)
- Fractional programming approach to a cost minimization problem in electricity market (Q3388407) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications (Q5861980) (← links)
