Finding Representative Systems for Discrete Bicriteria Optimization Problems by Box Algorithms

  • Given a discrete bicriteria optimization problem (DBOP), we propose two versions of an approximation procedure, the box algorithm, which results in a representation of the complete set of nondominated solutions by a finite representative system Rep satisfying the following quality features.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Horst W. Hamacher, Christian Roed Pedersen, Stefan Ruzika
URN (permanent link):urn:nbn:de:hbz:386-kluedo-13879
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (95)
Document Type:Preprint
Language of publication:English
Year of Completion:2005
Year of Publication:2005
Publishing Institute:Technische Universität Kaiserslautern
GND-Keyword:Box Algorithms; Discrete Bicriteria Optimization
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $