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

Recommendations

The two-phase method for multiobjective combinatorial optimization problems
scientific article; zbMATH DE number 915988
Three algorithms for bicriteria integer linear programs
Two phase algorithms for the bi-objective assignment problem
Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem

Cites work

scientific article; zbMATH DE number 3694968 (Why is no real title available?)
scientific article; zbMATH DE number 2159088 (Why is no real title available?)
scientific article; zbMATH DE number 915988 (Why is no real title available?)
A branch and bound algorithm for mixed zero-one multiple objective linear programming
A discussion of scalarization techniques for multiple objective integer programming
A method for finding the set of non-dominated vectors for multiple objective integer linear programs
A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
A note on a new variant of Murty's ranking assignments algorithm
A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
Algorithms for finding k-best perfect matchings
An algorithm for ranking assignments using reoptimization
An algorithm for the biobjective integer minimum cost flow problem
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
Bicriteria network flow problems: Integer case
Bound sets for biobjective combinatorial optimization problems
Computation of ideal and Nadir values and implications for their use in MCDM methods.
Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
Proper efficiency and the theory of vector maximization
Solving efficiently the 0-1 multi-objective knapsack problem
The bicriterion multimodal assignment problem: introduction, analysis, and experimental results
The problem of the optimal biobjective spanning tree
Two phase algorithms for the bi-objective assignment problem
Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(55)

A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
A box decomposition algorithm to compute the hypervolume indicator
Decomposition of loosely coupled integer programs: a multiobjective perspective
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
Multi-objective integer programming: an improved recursive algorithm
Guided moth-flame optimiser for multi-objective optimization problems
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
Distribution based representative sets for multi-objective integer programs
Bilevel programming for generating discrete representations in multiobjective optimization
The two-phase method for multiobjective combinatorial optimization problems
Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
Multiobjective Integer Programming: Synergistic Parallel Approaches
Optimising a nonlinear utility function in multi-objective integer programming
Monomial Tropical Cones for Multicriteria Optimization
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
The \(L\)-shape search method for triobjective integer programming
Dynamic programming algorithms for the bi-objective integer knapsack problem
Finding all nondominated points of multi-objective integer programs
A population-based algorithm for solving linear assignment problems with two objectives
Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
Relaxations and duality for multiobjective integer programming
Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
On the representation of the search region in multi-objective optimization
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
A fast and robust algorithm for solving biobjective mixed integer programs
A simple, efficient and versatile objective space algorithm for multiobjective integer programming
Augmenting bi-objective branch and bound by scalarization-based information
An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
A review of multiobjective programming and its application in quantitative psychology
Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects
Efficient computation of the search region in multi-objective optimization
A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
A two-phase algorithm for the biobjective integer minimum cost flow problem
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
MOBILE SECONDARY IDEAL POINT AND MOMA-PLUS METHOD IN TWO-PHASE METHOD FOR SOLVING BI-OBJECTIVE ASSIGNMENT PROBLEMS
Split algorithms for multiobjective integer programming problems
Two phase algorithms for the bi-objective assignment problem
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
Effective anytime algorithm for multiobjective combinatorial optimization problems
An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
Multi-objective branch and bound
A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
Two‐phase strategies for the bi‐objective minimum spanning tree problem
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models
Disjunctive Programming for Multiobjective Discrete Optimisation
Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs

This page was built for publication: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429651)