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

DOI10.1016/J.ORL.2004.02.002MaRDI QIDQ703276zbMATH OpenOpenAlexFDO

Authors 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

Bicriteria optimizationParametric method

Mathematics Subject Classification ID

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

Recommendations

• A general approximation method for bicriteria minimization problems
• A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
• Approximation methods for multiobjective and parametric optimization problems
• A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.

Cites work

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

Cited in

(6)

• A general approximation method for bicriteria minimization problems
• The constrained minimum weighted sum of job completion times problem
• scientific article; zbMATH DE number 969179 (Why is no real title available?)
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703276)