A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651): Difference between revisions

Latest revision as of 09:37, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives	scientific article

Statements

instance of

scholarly article

0 references

title

A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (English)

0 references

0 references

0 references

0 references

Discrete Optimization

0 references

publication date

20 June 2012

0 references

zbMATH Keywords

multi-objective combinatorial optimization

0 references

two phase method

0 references

assignment problem

0 references

ranking

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disopt.2010.03.005

0 references

cites work

Q4889471

0 references

Proper efficiency and the theory of vector maximization

0 references

Two phase algorithms for the bi-objective assignment problem

0 references

Bicriteria network flow problems: Integer case

0 references

An algorithm for the biobjective integer minimum cost flow problem

0 references

Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

0 references

The problem of the optimal biobjective spanning tree

0 references

Q4667002

0 references

A branch and bound algorithm for mixed zero-one multiple objective linear programming

0 references

A discussion of scalarization techniques for multiple objective integer programming

0 references

Q3888874

0 references

A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

0 references

Computation of ideal and Nadir values and implications for their use in MCDM methods.

0 references

Bound sets for biobjective combinatorial optimization problems

0 references

The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results

0 references

Algorithms for finding k-best perfect matchings

0 references

A note on a new variant of Murty's ranking assignments algorithm

0 references

An algorithm for ranking assignments using reoptimization

0 references

Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726]

0 references

Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

0 references

A method for finding the set of non-dominated vectors for multiple objective integer linear programs

0 references

An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method

0 references

Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem

0 references

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

0 references

Solving efficiently the 0-1 multi-objective knapsack problem

0 references

Identifiers

zbMATH Open document ID

1241.90138

0 references

DOI

10.1016/j.disopt.2010.03.005

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:429651

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2010.03.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2080673141
@@ Property / OpenAlex ID: W2080673141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4889471
@@ Property / cites work: Q4889471 / rank @@
+Normal rank
@@ Property / cites work @@
+Proper efficiency and the theory of vector maximization
+Normal rank
@@ Property / cites work @@
+Two phase algorithms for the bi-objective assignment problem
+Normal rank
@@ Property / cites work @@
+Bicriteria network flow problems: Integer case
@@ Property / cites work: Bicriteria network flow problems: Integer case / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the biobjective integer minimum cost flow problem
+Normal rank
@@ Property / cites work @@
+Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
+Normal rank
@@ Property / cites work @@
+The problem of the optimal biobjective spanning tree
+Normal rank
@@ Property / cites work @@
+Q4667002
@@ Property / cites work: Q4667002 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for mixed zero-one multiple objective linear programming
+Normal rank
@@ Property / cites work @@
+A discussion of scalarization techniques for multiple objective integer programming
+Normal rank
@@ Property / cites work @@
+Q3888874
@@ Property / cites work: Q3888874 / rank @@
+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 @@
+Computation of ideal and Nadir values and implications for their use in MCDM methods.
+Normal rank
@@ Property / cites work @@
+Bound sets for biobjective combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
+Normal rank
@@ Property / cites work @@
+Algorithms for finding k-best perfect matchings
@@ Property / cites work: Algorithms for finding k-best perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+A note on a new variant of Murty's ranking assignments algorithm
+Normal rank
@@ Property / cites work @@
+An algorithm for ranking assignments using reoptimization
+Normal rank
@@ Property / cites work @@
+Erratum to ``An algorithm for ranking assignments using reoptimization'' [Computers \& Operations Research 35 (2008) 3714-3726]
+Normal rank
@@ Property / cites work @@
+Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
+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 @@
+An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
+Normal rank
@@ Property / cites work @@
+Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
+Normal rank
@@ Property / cites work @@
+A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+Solving efficiently the 0-1 multi-objective knapsack problem
+Normal rank