Strongly polynomial-time approximation for a class of bicriteria problems.

DOI10.1016/j.orl.2004.02.002zbMath1054.90069OpenAlexW2073025934MaRDI QIDQ703276

Asaf Levin

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.002

zbMATH Keywords

Parametric methodBicriteria optimization

Mathematics Subject Classification ID

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

Related Items (4)

Real time scheduling with a budget: parametric-search is better than binary search ⋮ Partial multicuts in trees ⋮ Approximation algorithm for minimizing total latency in machine scheduling with deliveries ⋮ The constrained minimum weighted sum of job completion times problem

Cites Work

• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Combinatorial Optimization with Rational Objective Functions
• Bicriteria Network Design Problems
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Strongly polynomial-time approximation for a class of bicriteria problems.