Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
From MaRDI portal
Publication:2263325
DOI10.1007/s10559-014-9650-4zbMath1308.90208OpenAlexW2127311312MaRDI QIDQ2263325
L. N. Koliechkina, A. N. Nagornaya, O. A. Dvernaya
Publication date: 18 March 2015
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: http://dspace.puet.edu.ua/handle/123456789/3424
extremum problemscombinatorial configurationsmulticriteriality conditioncoordinate methodextremum problems on combinatorial configurations
Applications of graph theory (05C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items
The polyhedral-surface cutting plane method of optimization over a vertex-located set, Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality, A method to solve conditional optimization problems with quadratic objective functions on the set of permutations, Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations, A two-step method for solving vector optimization problems on permutation configuration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vector optimization problems with linear criteria over a fuzzy combinatorial set of alternatives
- Multicriteria combinatorial optimization problems on a set of polypermutations
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
- Method of ordering the values of a linear function on a set of permutations