Abstract
The statement of a problem of Euclidean combinatorial optimization with a fractional-linear objective function on a common set of permutations and with additional linear constraints is formulated. A problem with a fractional-linear objective function is transformed into that with a linear objective function. An approach is proposed to the solution of such problems, and a method of combinatorial truncation of solutions of problems of combinatorial type with fractional-linear objective functions on permutations is developed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
