Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
DOI10.1007/S10559-017-9924-8zbMATH Open1392.90097OpenAlexW2602847420MaRDI QIDQ681902FDOQ681902
Authors: O. O. Iemets, T. M. Barbolina 
Publication date: 13 February 2018
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-017-9924-8
Recommendations
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- Some properties of the region of admissible solutions of the problem with linear-fractional objective function on arrangements
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
Euclidian problem of combinatorial optimizationlexicographic equivalencelinear-fractional functionoptimization problem on arrangements
Cites Work
- Method of ordering the values of a linear function on a set of permutations
- Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements
- About optimization problems with probabilistic uncertainty
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- Title not available (Why is that?)
- Classification of applied methods of combinatorial optimization
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
- Title not available (Why is that?)
- Some properties of the region of admissible solutions of the problem with linear-fractional objective function on arrangements
Cited In (3)
- Solution of mixed combinatorial optimization problems on arrangements by the method of construction of lexicographic equivalence
- Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
This page was built for publication: Lexicographic equivalence in mixed combinatorial optimization of linear-fractional functions on arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681902)
