| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hans Kellerer, Vladimir Kotov |
A 3/2-approximation algorithm for 3/2-partitioning.  |
Oper. Res. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Chakhlevitch, Celia A. Glass, Hans Kellerer |
Batch machine production with perishability time windows and limited batch size. |
European Journal of Operational Research |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Imed Kacem, Hans Kellerer |
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. |
J. Scheduling |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Imed Kacem, Hans Kellerer |
Foreword: Combinatorial optimization for industrial engineering. |
Computers & Industrial Engineering |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich |
Transporting Jobs through a Processing Center with Two Parallel Machines. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Mikhail A. Kubzin, Vitaly A. Strusevich |
Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich |
Operator non-availability periods. |
4OR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer |
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer |
Knapsack. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov |
Semi-on-line multiprocessor scheduling with given total processing time. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy |
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
fully polynomial approximation scheme, dynamic programming, knapsack problem |
| 1 | Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov |
Algorithms for on-line bin-packing problems with cardinality constraints. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy, David Pisinger |
Knapsack problems. |
|
2004 |
RDF |
|
| 1 | Hans Kellerer, Vladimir Kotov |
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Scheduling parallel dedicated machines under a single non-shared resource. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
A 3/4-Approximation Algorithm for Multiple Subset Sum. |
J. Heuristics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vitaly A. Strusevich |
Scheduling problems for parallel dedicated machines under multiple resource constraints. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza |
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Greistorfer, Hans Kellerer |
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. |
J. Heuristics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
Approximating Multi-objective Knapsack Problems. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
Approximation Schemes for Ordered Vector Packing Problems. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov |
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
on-line, bin packing, cardinality constraint |
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy |
The Multiple Subset Sum Problem. |
SIAM Journal on Optimization |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Renata Mansini, Maria Grazia Speranza |
Two linear approximation algorithms for the subset-sum problem. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger |
Approximation algorithms for knapsack problems with cardinality constraints. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | József Békési, Gábor Galambos, Hans Kellerer |
A 5/4 Linear Time Bin Packing Algorithm. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy |
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. |
J. Comb. Optim. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger |
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer |
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. |
RANDOM-APPROX |
1999 |
DBLP BibTeX RDF |
|
| 1 | Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza |
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer E. Burkard, Y. He, Hans Kellerer |
A Linear Compound Algorithm for Uniform Machine Scheduling. |
Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy |
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza |
Semi on-line algorithms for the partition problem. |
Oper. Res. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza |
An Efficient Approximation Scheme for the Subset-Sum Problem. |
ISAAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger |
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
total flow time, scheduling, approximation algorithm, worst case analysis, release time, single machine |
| 1 | Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger |
A Lower Bound for On-Line Vector-Packing Algorithms. |
Acta Cybern. |
1993 |
DBLP BibTeX RDF |
|
| 1 | Hans Kellerer, Gerhard J. Woeginger |
On the Euclidean two Paths Problem. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Gerhard J. Woeginger |
A Tight Bound for 3-Partitioning. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Franz Rendl, Gerhard J. Woeginger |
Computing the optimum stock size. |
IPCO |
1993 |
DBLP BibTeX RDF |
|
| 1 | Hans Kellerer, Gerhard J. Woeginger |
UET-scheduling with constrained processor allocations. |
Computers & OR |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kellerer, Günther Wirsching |
Prime covers and periodic patterns. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Werner Heise, Hans Kellerer |
Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4. |
Elektronische Informationsverarbeitung und Kybernetik |
1987 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")