An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
From MaRDI portal
(Redirected from Publication:691453)
Recommendations
- scientific article; zbMATH DE number 6178192
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An output-space branch-and-bound algorithm for finding the global solution of the sum-of-linear-ratios problem
- A practicable branch and bound algorithm for sum of linear ratios problem
- A branch and bound algorithm to globally solve the sum of several linear ratios
- scientific article; zbMATH DE number 7267293
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- A branch and bound algorithm for a class of non-convex programming problems
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
Cites work
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 2196500 (Why is no real title available?)
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A combined algorithm for fractional programming
- A note on the sum of a linear and linear-fractional function
- A unified monotonic approach to generalized linear fractional programming
- Conical partition algorithm for maximizing the sum of dc ratios
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
- Fractional programming: The sum-of-ratios case
- Global optimization of fractional programs
- Minimization of the sum of three linear fractional functions
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Solving sum-of-ratios fractional programs using efficient points
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(12)- scientific article; zbMATH DE number 7267293 (Why is no real title available?)
- A note on the paper ``Global optimization of nonlinear sum of ratios
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- A numerical study on B\&B algorithms for solving sum-of-ratios problem
- A practicable branch and bound algorithm for sum of linear ratios problem
- scientific article; zbMATH DE number 6178192 (Why is no real title available?)
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems
- Solving the sum-of-ratios problems by a harmony search algorithm
- An exact method for solving the integer sum of linear ratios problem
This page was built for publication: An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691453)
