Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem (Q3649594): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85646-7_8
+Normal rank
@@ Property / OpenAlex ID @@
+W63335672
@@ Property / OpenAlex ID: W63335672 / rank @@
+Normal rank
@@ Property / cites work @@
+Bound sets for biobjective combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Computation of ideal and Nadir values and implications for their use in MCDM methods.
+Normal rank
@@ Property / cites work @@
+On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
+Normal rank
@@ Property / cites work @@
+A method for finding the set of non-dominated vectors for multiple objective integer linear programs
+Normal rank
@@ Property / cites work @@
+A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
+Normal rank
@@ Property / cites work @@
+Two phase algorithms for the bi-objective assignment problem
+Normal rank
@@ Property / cites work @@
+An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
+Normal rank
@@ Property / cites work @@
+A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
+Normal rank
@@ Property / cites work @@
+Q4889471
@@ Property / cites work: Q4889471 / rank @@
+Normal rank