• Home
  • Search
  • Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems
  • Cite Icon29
  • https://doi.org/10.1007/978-3-642-56680-6_22Copy DOI Icon

Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems

  • Jan 1, 2001
  • Matthias Ehrgott +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Multiobjective combinatorial optimization problems are important tools for modeling real world decision problems. It is well known that they are very difficult to solve, therefore bounds on efficient solutions can contribute to obtaining good solutions quickly. We propose to generalize the notion of lower and upper bounds for single objective problems to lower and upper bound sets in multiobjective optimization. We distinguish the cases of polynomial and NP-hard single objective problems. We prove some general results on bound sets. Finally, we consider the 0-1 knapsack problem and report some numerical experiments.KeywordsMulticriteria OptimizationCombinatorial OptimizationKnapsack ProblemBounds

Similar Papers
  • Book Chapter
  • Citations1

A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization

  • Jan 01, 2017
  • Jianmei Guo +3
  • Research Article
  • Citations12

Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions

  • Feb 07, 2019
  • Journal of Global Optimization
  • Britta Schulze +2
  • Conference Article
  • Citations1

A Multi-Objective Minimum Matrix Search Algorithm Applied to Large-Scale Bi-Objective TSP

  • Jul 01, 2018
  • Michael Manuel Smith +1
  • Research Article
  • Citations1

Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects

  • Mar 03, 2020
  • 4OR
  • Pham Thi Hoai +2
  • Research Article
  • Citations8

On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization

  • Oct 12, 2012
  • 4OR
  • Julien Roland +2
  • Book Chapter
  • Citations12

Multi-objective Optimization of Engineering Design Problems Through Pareto-Based Bat Algorithm

  • Jun 10, 2020
  • Deniz Ustun +2
  • Conference Article
  • Citations9

The Effect of Credit Definition and Aggregation Strategies on Multi-Objective Hyper-Heuristics

  • Aug 02, 2015
  • Nozomi Hitomi +1
  • Research Article
  • Citations60

An interactive heuristic method for multi-objective combinatorial optimization

  • Mar 13, 2000
  • Computers & Operations Research
  • J Teghem +2
  • Conference Article
  • Citations1

Multiobjective optimization for Volt/Thd oroblem in distribution system

  • Jul 01, 2014
  • Angelo M F De Almeida +4
  • Conference Article
  • Citations1

Partial preference models using translated cones in discrete multi-objective optimization

  • Dec 01, 2016
  • Sami Kaddani +3
  • Research Article
  • Citations2

Multi-objective evolutionary algorithm on simplified bi-objective minimum weight minimum label spanning tree problems

  • Jan 01, 2019
  • International Journal of Computational Science and Engineering
  • Xinsheng Lai +1
  • Book Chapter
  • Citations2

A Test Suite for Multi-objective Multi-fidelity Optimization

  • Jan 01, 2023
  • Angus Kenny +3
  • Conference Article
  • Citations8

Weight-Specific-Decoder Attention Model to Solve Multiobjective Combinatorial Optimization Problems

  • Oct 09, 2022
  • Te Ye +3
  • Book Chapter
  • Citations57

Hybrid Metaheuristics for Multi-objective Combinatorial Optimization

  • Jan 01, 2008
  • Matthias Ehrgott +1
  • Research Article
  • Citations496

An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems

  • Apr 23, 2013
  • Applied Mathematics and Computation
  • George Mavrotas +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.