Strongly polynomial-time approximation for a class of bicriteria problems.
type: Item
instance of: scholarly article
title: Strongly polynomial-time approximation for a class of bicriteria problems.
zbMATH Open document ID: 1054.90069
author: Asaf Levin
published in: Operations Research Letters
publication date: 2005-01-11T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2125916
zbMATH Keywords: Parametric method
zbMATH Keywords: Bicriteria optimization
MaRDI profile type: Publication
full work available at URL: j.orl.2004.02.002
OpenAlex ID: W2073025934
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Parametric Combinatorial Computing and a Problem of Program Module Distribution
cites work: Bicriteria Network Design Problems
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
DOI: 10.1016/J.ORL.2004.02.002
description: scientific article; zbMATH DE number 2125916