The two-phase method for multiobjective combinatorial optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 915988
- Problema de asignacion cuadratica multiobjetivo
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Two phase algorithms for the bi-objective assignment problem
- scientific article; zbMATH DE number 2156685
Cited in
(10)- A bi-objective approach to discrete cost-bottleneck location problems
- Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
- Two phase algorithms for the bi-objective assignment problem
- An Extension of the MOON2/MOON2R Approach to Many-Objective Optimization Problems
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
This page was built for publication: The two-phase method for multiobjective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109954)
