A Fully Polynomial Approximation Scheme for the Euclidean Steiner Augmentation Problem

Advances in Steiner Trees - Combinatorial Optimization ◽

10.1007/978-1-4757-3171-2_11 ◽

2000 ◽

pp. 235-253 ◽

Cited By ~ 2

Author(s):

J. Scott Provan

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Fully Polynomial Approximation Scheme

Download Full-text

A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem

Operations Research ◽

10.1287/opre.47.5.757 ◽

1999 ◽

Vol 47 (5) ◽

pp. 757-761 ◽

Cited By ~ 63

Author(s):

Mikhail Y. Kovalyov ◽

Wieslaw Kubiak

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Fully Polynomial Approximation Scheme ◽

Weighted Earliness

Download Full-text

A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/978-3-642-22300-6_61 ◽

2011 ◽

pp. 704-715 ◽

Cited By ~ 1

Author(s):

Zhou Xu ◽

Xiaofan Lai

Keyword(s):

Polynomial Approximation ◽

Knapsack Problem ◽

Approximation Scheme ◽

Fully Polynomial Approximation Scheme

Download Full-text

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

Journal of Computer and System Sciences ◽

10.1016/s0022-0000(03)00006-0 ◽

2003 ◽

Vol 66 (2) ◽

pp. 349-370 ◽

Cited By ~ 40

Author(s):

Hans Kellerer ◽

Renata Mansini ◽

Ulrich Pferschy ◽

Maria Grazia Speranza

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Subset Sum Problem ◽

Fully Polynomial Approximation Scheme ◽

Subset Sum

Download Full-text

A new fully polynomial approximation scheme for the knapsack problem

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053969 ◽

1998 ◽

pp. 123-134 ◽

Cited By ~ 13

Author(s):

Hans Kellerer ◽

Ulrich Pferschy

Keyword(s):

Polynomial Approximation ◽

Knapsack Problem ◽

Approximation Scheme ◽

Fully Polynomial Approximation Scheme

Download Full-text

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

Mathematics of Operations Research ◽

10.1287/moor.19.1.86 ◽

1994 ◽

Vol 19 (1) ◽

pp. 86-93 ◽

Cited By ~ 27

Author(s):

M. Y. Kovalyov ◽

C. N. Potts ◽

L. N. van Wassenhove

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Approximation Scheme ◽

Late Work ◽

Fully Polynomial Approximation Scheme

Download Full-text

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays

Operations Research Letters ◽

10.1016/s0167-6377(98)00012-1 ◽

1998 ◽

Vol 23 (1-2) ◽

pp. 9-11 ◽

Cited By ~ 2

Author(s):

Petra Schuurman

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Scheduling Problem ◽

Fully Polynomial Approximation Scheme

Download Full-text

A faster fully polynomial approximation scheme for the single-machine total tardiness problem

European Journal of Operational Research ◽

10.1016/j.ejor.2007.12.031 ◽

2009 ◽

Vol 193 (2) ◽

pp. 637-638 ◽

Cited By ~ 6

Author(s):

Christos Koulamas

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Approximation Scheme ◽

Total Tardiness ◽

Fully Polynomial Approximation Scheme

Download Full-text

A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility

Operations Research ◽

10.1287/opre.38.1.70 ◽

1990 ◽

Vol 38 (1) ◽

pp. 70-83 ◽

Cited By ~ 16

Author(s):

Bezalel Gavish ◽

Robert E. Johnson

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Finite Capacity ◽

Single Product ◽

Fully Polynomial Approximation Scheme

Download Full-text

A fully polynomial approximation scheme for the total tardiness problem

Operations Research Letters ◽

10.1016/0167-6377(82)90022-0 ◽

1982 ◽

Vol 1 (6) ◽

pp. 207-208 ◽

Cited By ~ 48

Author(s):

E.L. Lawler

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Total Tardiness ◽

Fully Polynomial Approximation Scheme

Download Full-text

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

Theoretical Computer Science ◽

10.1016/j.tcs.2006.08.030 ◽

2006 ◽

Vol 369 (1-3) ◽

pp. 230-238 ◽

Cited By ~ 24

Author(s):

Hans Kellerer ◽

Vitaly A. Strusevich

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Approximation Scheme ◽

Total Tardiness ◽

Due Date ◽

Common Due Date ◽

Fully Polynomial Approximation Scheme

Download Full-text