An exact method for solving the integer sum of linear ratios problem
From MaRDI portal
Publication:6198512
Recommendations
- Reduction-branch-bound algorithm for solving sum of linear ratios problems
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- An output-space branch-and-bound algorithm for finding the global solution of the sum-of-linear-ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization algorithm for the nonlinear sum of ratios problem
Cites work
- scientific article; zbMATH DE number 3976806 (Why is no real title available?)
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A eighth bibliography of fractional programming
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A note on the sum of a linear and linear-fractional function
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- An algorithm for optimizing a linear function over an integer efficient set
- An exact method for a discrete multiobjective linear fractional optimization
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Cluster Analysis and Mathematical Programming
- Finding a solution for multi-objective linear fractional programming problem based on goal programming and data envelopment analysis
- Fractional programming: The sum-of-ratios case
- Global optimization algorithm for the nonlinear sum of ratios problem
- Integer Programming
- Linear-fractional programming. Theory, methods, applications and software.
- Mesh shape-quality optimization using the inverse mean-ratio metric
- Multi-objective integer programming: an improved recursive algorithm
- Programming with linear fractional functionals
- Solving the sum-of-ratios problem by an interior-point method
- The \(L\)-shape search method for triobjective integer programming
- \(NP\)-hardness of linear multiplicative programming and related problems
This page was built for publication: An exact method for solving the integer sum of linear ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198512)