Bound sets for biobjective combinatorial optimization problems

Authors:
Matthias Ehrgott;Xavier Gandibleux
Affiliations:
Department of Engineering Science, University of Auckland, Private Bag 92019, Auckland, New Zealand;LINA - FRE CNRS 2729, Université de Nantes, 2, Rue de la Houssinière BP 92208, F-44322 Nantes Cedex 03, France
Venue:
Computers and Operations Research
Year:
2007

Citing 5
Cited 11

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Lagrangian relaxation

Modern heuristic techniques for combinatorial problems
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation

Bucket elimination for multiobjective optimization problems

Journal of Heuristics
Solving efficiently the 0-1 multi-objective knapsack problem

Computers and Operations Research
Speed-up techniques for solving large-scale biobjective TSP

Computers and Operations Research
An efficient implementation for the 0-1 multi-objective Knapsack problem

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Two-phase Pareto local search for the biobjective traveling salesman problem

Journal of Heuristics
Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

Discrete Optimization
On beam search for multicriteria combinatorial optimization problems

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case

Computers and Operations Research
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

INFORMS Journal on Computing
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we introduce the concept of bound sets for multiobjective discrete optimization. We prove general results on lower and upper bound sets for combinatorial optimization problems with multiple objectives. We present general algorithms for constructing lower and upper bound sets for biobjective problems and provide numerical results on five different problem types.