A method to solve conditional optimization problems with quadratic objective functions on the set of permutations

DOI10.1007/S10559-020-00243-8MaRDI QIDQ2215299zbMATH OpenOpenAlexFDO

Authors G. P. Donets, L. M. Koliechkina, A. M. Nahirna

Publication date 11 December 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-020-00243-8

zbMATH Keywords

conditional optimizationconstraint incrementfunction incrementoptimal solutionquadratic functionset of feasible solutionsset of permutationsset of support solutionstransposition of elements

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4127014
• Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
• Conditions for the strong solvability of optimization problems on permutations and their application.
• Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• scientific article; zbMATH DE number 618550
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• scientific article; zbMATH DE number 4059102
• A two-step method for solving vector optimization problems on permutation configuration
• Optimization problem on permutations with linear-fractional objective function: Properties of the set of admissible solutions

Cites work

• A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
• A polyhedral approach to the solution of a class of vector problems of combinatorial optimization
• An approach to solving discrete vector optimization problems over a combinatorial set of permutations
• Automorphism group of the complete transposition graph
• Combinatorial optimization. Theory and algorithms.
• Construction of Hamiltonian paths in graphs of permutation polyhedra
• Convex extensions in combinatorial optimization and their applications
• Differential evolution: A handbook for global permutation-based combinatorial optimization. With CD-ROM
• Handbook of combinatorial optimization. In 5 volumes
• scientific article; zbMATH DE number 2160609 (Why is no real title available?)
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Method of ordering the values of a linear function on a set of permutations
• Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
• Multicriteria Optimization
• Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality
• Transposition Graphs

Cited in

(5)

• A two-step method for solving vector optimization problems on permutation configuration
• Penalty weights in QUBO formulations: permutation problems
• Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations
• Special transpositions of permutation elements and properties of their composition
• scientific article; zbMATH DE number 4127014 (Why is no real title available?)

This page was built for publication: A method to solve conditional optimization problems with quadratic objective functions on the set of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215299)