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

DOI10.1016/j.disopt.2010.03.005zbMath1241.90138OpenAlexW2080673141MaRDI QIDQ429651

Matthias Ehrgott, Xavier Gandibleux, Anthony Przybylski

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.03.005

zbMATH Keywords

rankingassignment problemmulti-objective combinatorial optimizationtwo phase method

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (46)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
• Bound sets for biobjective combinatorial optimization problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Algorithms for finding k-best perfect matchings
• Bicriteria network flow problems: Integer case
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• A note on a new variant of Murty's ranking assignments algorithm
• The problem of the optimal biobjective spanning tree
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A discussion of scalarization techniques for multiple objective integer programming
• Two phase algorithms for the bi-objective assignment problem
• An algorithm for ranking assignments using reoptimization
• Proper efficiency and the theory of vector maximization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• An algorithm for the biobjective integer minimum cost flow problem

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