scientific article; zbMATH DE number 1104339
From MaRDI portal
Publication:4370212
zbMath0888.90123MaRDI QIDQ4370212
Ulrich Pferschy, Hans Kellerer, Maria Grazia Speranza
Publication date: 14 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Related Items (3)
An efficient fully polynomial approximation scheme for the Subset-Sum problem. ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Approximation algorithms for knapsack problems with cardinality constraints
This page was built for publication:
