The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets

DOI10.1016/0041-5553(86)90072-8zbMath0628.90054OpenAlexW1994308954MaRDI QIDQ3765559

Ya. M. Shafransky, Mikhail Y. Kovalyov

Publication date: 1986

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(86)90072-8

zbMATH Keywords

\(\epsilon \)-approximate algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

This page was built for publication: The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets