A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-009-9110-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2054914201
@@ Property / OpenAlex ID: W2054914201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4745600
@@ Property / cites work: Q4745600 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4880741
@@ Property / cites work: Q4880741 / rank @@
+Normal rank
@@ Property / cites work @@
+Existence of solutions in vector optimization problems
+Normal rank
@@ Property / cites work @@
+Q4455572
@@ Property / cites work: Q4455572 / rank @@
+Normal rank
@@ Property / cites work @@
+Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
+Normal rank
@@ Property / cites work @@
+An approach to solving discrete vector optimization problems over a combinatorial set of permutations
+Normal rank
@@ Property / cites work @@
+Q4518696
@@ Property / cites work: Q4518696 / rank @@
+Normal rank
@@ Property / cites work @@
+Polyhedral techniques in combinatorial optimization I: Theory
+Normal rank
@@ Property / cites work @@
+Polyhedral techniques in combinatorial optimization II: applications and computations
+Normal rank
@@ Property / cites work @@
+Q5191744
@@ Property / cites work: Q5191744 / rank @@
+Normal rank