A branch-and-cut algorithm for a class of sum-of-ratios problems
From MaRDI portal
(Redirected from Publication:668157)
Recommendations
- Global optimization for the sum of concave-convex ratios problem
- On the global optimization for a class of sum of convex-convex ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Global optimization for a class of nonlinear sum of ratios problem
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A convex analysis approach for convex multiplicative programming
- A global optimization algorithm for linear fractional programming
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- An outcome space approach for generalized convex multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Finding all solutions of nonlinearly constrained systems of equations
- Fractional programming: Applications and algorithms
- Fractional programming: The sum-of-ratios case
- Generalized Concavity
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for a class of nonlinear sum of ratios problem
- Global optimization for the sum of concave-convex ratios problem
- Global optimization of nonlinear sum of ratios problem
- Global optimization of nonlinear sums of ratios
- Image space analysis of generalized fractional programs
- Introduction to global optimization.
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On the solution of generalized multiplicative extremum problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- 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
- Using conical partition to globally maximizing the nonlinear sum of ratios
Cited in
(18)- An effective computational algorithm for the global solution of a class of linear fractional programming
- On solving the sum-of-ratios problem
- 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
- Projection heuristics for binary branchings between sum and product
- scientific article; zbMATH DE number 4176854 (Why is no real title available?)
- A branch-and-cut algorithm for the equicut 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?)
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- A branch \& cut technique to solve a weighted-sum of linear ratios
- On Maximizing a Sum of Ratios
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- A new deterministic global computing algorithm for solving a kind of linear fractional programming
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm
This page was built for publication: A branch-and-cut algorithm for a class of sum-of-ratios problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668157)
