Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
From MaRDI portal
Recommendations
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- Fractional programming with convex quadratic forms and functions
- An efficient algorithm for solving convex-convex quadratic fractional programs
- Constrained ratio games and generalized fractional programming
- An efficient algorithm for solving a class of fractional programming problems
- An algorithm for solving quadratic fractional program with linear homogeneous constraints
- Integer quadratic fractional programming problems with bounded variables
- Algorithms for generalized fractional programming
- scientific article; zbMATH DE number 4149911
- On quadratic programming with a ratio objective
Cites work
- A method for solving nonlinear maximum‐problems depending on parameters
- A parametric method for solving certain nonconcave maximization problems
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- Approximation of algebraic numbers by algebraic numbers
- Combinatorial Optimization with Rational Objective Functions
- Computational complexity of parametric linear programming
- Efficient search for rationals
- Factoring polynomials with rational coefficients
- Fractional programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3134383 (Why is no real title available?)
- scientific article; zbMATH DE number 3848997 (Why is no real title available?)
- scientific article; zbMATH DE number 3850851 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 3465382 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3226460 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Identification of algebraic numbers
- Khachiyan’s algorithm for linear programming
- Linear Programming Solutions to Ratio Games
- On Nonlinear Fractional Programming
- On some stocxastic tactical antisubmarine games
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Parametric approaches to fractional programs
- Rational search
- The Weighted Euclidean 1-Center Problem
- The weighted Euclidean 1-center problem
Cited in
(9)- Stock cutting to minimize cutting length
- Geometric problems in automated manufacturing.
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- A Fourth bibliography of fractional programming
- Further analysis of the Weber problem
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- On the probability that the optimal solution of the Weber location problem is at a demand point
- Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
- The use of relative priorities in optimizing the performance of a queueing system
This page was built for publication: Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688122)
