Bound sets for biobjective combinatorial optimization problems

DOI10.1016/j.cor.2005.10.003zbMath1141.90509OpenAlexW1968876856MaRDI QIDQ875413

Publication date: 13 April 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.10.003

zbMATH Keywords

heuristics upper bound relaxation lower bound multiobjective discrete optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (57)

Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization ⋮ On upper approximations of Pareto fronts ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Bi-objective design-for-control of water distribution networks with global bounds ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ On the representation of the search region in multi-objective optimization ⋮ A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints ⋮ Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems ⋮ Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case ⋮ Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ A supply chain design problem with facility location and bi-objective transportation choices ⋮ Limit sets in global multiobjective optimization ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs ⋮ Lower bound sets for biobjective shortest path problems ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ A simple method for approximating a general Pareto surface ⋮ Solving efficiently the 0-1 multi-objective knapsack problem ⋮ Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ 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 ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ B{\&}B method for discrete partial order optimization ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ Cooperative multiobjective optimization with bounds on objective functions ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ Bi-objective optimisation over a set of convex sub-problems

Uses Software

MCDMlib

Cites Work

This page was built for publication: Bound sets for biobjective combinatorial optimization problems