Pages that link to "Item:Q668157"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157):
Displaying 15 items.
- A practicable branch and bound algorithm for sum of linear ratios problem (Q319186) (← links)
- A branch-and-bound algorithm for maximizing the sum of several linear ratios (Q598594) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- A reduced space branch and bound algorithm for a class of sum of ratios problems (Q1647365) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- An effective computational algorithm for the global solution of a class of linear fractional programming (Q2214840) (← links)
- Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm (Q2417295) (← links)
- On solving the sum-of-ratios problem (Q2422872) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem (Q2680084) (← links)
- (Q4928051) (← links)
- An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem (Q6077941) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- A new deterministic global computing algorithm for solving a kind of linear fractional programming (Q6106322) (← links)
