Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
From MaRDI portal
Publication:2263228
Recommendations
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- scientific article; zbMATH DE number 5158649
- Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
- Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
- scientific article; zbMATH DE number 6907481
- scientific article; zbMATH DE number 1778425
- An effective branch and bound algorithm for minimax linear fractional programming
- Conditional optimization problems: fractional order case
- scientific article; zbMATH DE number 3976808
Cites work
- An Automatic Method of Solving Discrete Programming Problems
- scientific article; zbMATH DE number 3801290 (Why is no real title available?)
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- Transportation problems on permutations: properties of estimates in the branch and bound method
Cited in
(17)- Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality
- Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
- Optimal search for locally feasible solutions of a linear function on permutations
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
- A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
- Searching for optimal vine in pair-copula constructions
- On the Solution of Problems of Nonlinear Conditional Optimization on Arrangements by the Cut-Off Method
- Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- scientific article; zbMATH DE number 2168886 (Why is no real title available?)
- scientific article; zbMATH DE number 2206808 (Why is no real title available?)
- Some properties of the region of admissible solutions of the problem with linear-fractional objective function on arrangements
- Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
This page was built for publication: Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263228)
