A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
From MaRDI portal
Publication:1040407
DOI10.1007/S10559-009-9110-8zbMATH Open1178.90297OpenAlexW2054914201MaRDI QIDQ1040407FDOQ1040407
N. V. Semenova, L. N. Kolechkina
Publication date: 24 November 2009
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-009-9110-8
discrete optimizationmulticriterion optimizationPareto-optimal solutionscombinatorial setspolyarrangementsweakly and strongly efficient solutions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
- Existence of solutions in vector optimization problems
- Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Polyhedral techniques in combinatorial optimization I: Theory
Cited In (6)
- A two-step method for solving vector optimization problems on permutation configuration
- A method to solve conditional optimization problems with quadratic objective functions on the set of permutations
- Description and generation of permutations containing cycles
- Generating combinatorial sets with given properties
- Title not available (Why is that?)
- Continuous representations and functional extensions in combinatorial optimization
This page was built for publication: A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040407)
