A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
From MaRDI portal
Publication:6667698
Cites work
- scientific article; zbMATH DE number 1342815 (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 global optimization algorithm for linear fractional and bilinear programs
- A new reformulation-linearization technique for bilinear programming problems
- A note on the sum of a linear and linear-fractional function
- A practicable branch and bound algorithm for sum of linear ratios problem
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem
- A unified monotonic approach to generalized linear fractional programming
- An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- An equilibrium efficiency frontier data envelopment analysis approach for evaluating decision-making units with fixed-sum outputs
- An interior-point method for generalized linear-fractional programming
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- BARON: A general purpose global optimization software package
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs
- Cluster Analysis and Mathematical Programming
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- Encyclopedia of optimization. In 6 vols.
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Fractional programming: The sum-of-ratios case
- Global minimization of a generalized convex multiplicative function
- Global optimization algorithm for the nonlinear sum of ratios problem
- Image space analysis of generalized fractional programs
- Jointly Constrained Biconvex Programming
- Jointly constrained bilinear programs and related problems: An overview
- Network data envelopment analysis: a review
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- On Maximizing a Sum of Ratios
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- On the global optimization of sums of linear fractional functions over a convex set
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Queueing-location problems on the plane
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving sum-of-ratios fractional programs using efficient points
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- \(NP\)-hardness of linear multiplicative programming and related problems
This page was built for publication: A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667698)
