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.005zbMATH Open1241.90138OpenAlexW2080673141MaRDI QIDQ429651FDOQ429651

Authors: Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott 

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

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

zbMATH Keywords

assignment problemrankingtwo phase methodmulti-objective combinatorial optimization

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (55)

• 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
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
• A box decomposition algorithm to compute the hypervolume indicator
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• 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
• Distribution based representative sets for multi-objective integer programs
• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• Bilevel programming for generating discrete representations in multiobjective optimization
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
• The two-phase method for multiobjective combinatorial optimization 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
• Relaxations and duality for multiobjective integer programming
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming
• A population-based algorithm for solving linear assignment problems with two objectives
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• On the representation of the search region in multi-objective optimization
• 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
• 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
• An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem
• Effective anytime algorithm for multiobjective combinatorial optimization problems
• Two phase algorithms for the bi-objective assignment problem
• An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
• 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)