Hans Kellerer

Proceedings of the Computational Logistics - 9th International Conference, 2018

2017

Approximability issues for unconstrained and constrained maximization of half-product related functions.

[BibT_eX]

[DOI]

Rebecca Sarto Basso

Theor. Comput. Sci., 2017

2016

Knapsack.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Semi-online scheduling on a single machine with unexpected breakdown.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Foreword - Advanced Optimization Approaches and Modern OR-Applications.

[BibT_eX]

[DOI]

Pierre Laroche

RAIRO Oper. Res., 2016

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval.

[BibT_eX]

[DOI]

Maryam Seifaddini

J. Comb. Optim., 2016

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

2015

Offline black and white bin packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.

[BibT_eX]

[DOI]

Michaël Gabay

J. Sched., 2015

Online Results for Black and White Bin Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals.

[BibT_eX]

[DOI]

Yann Lanuel

J. Comb. Optim., 2015

2014

Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Between laboratory and simulator: a cognitive approach to evaluating cockpit interfaces by manipulating informatory context.

[BibT_eX]

[DOI]

Armin Eichinger

Johannes Kellerer

Cogn. Technol. Work., 2014

2013

Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance.

[BibT_eX]

[DOI]

Kabir Rustogi

J. Sched., 2013

An efficient algorithm for bin stretching.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Preemptive scheduling on two identical parallel machines with a single transporter.

[BibT_eX]

[DOI]

Alan J. Soper

J. Comb. Optim., 2013

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

2012

Algorithms better than LPT for semi-online scheduling with decreasing processing times.

[BibT_eX]

[DOI]

T. C. E. Cheng

Oper. Res. Lett., 2012

Parallel dedicated machines scheduling with chain precedence constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

The symmetric quadratic knapsack problem: approximation and scheduling applications.

[BibT_eX]

[DOI]

4OR, 2012

Black and White Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

Scheduling Two Chains on Parallel Dedicated Machines.

[BibT_eX]

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates.

[BibT_eX]

[DOI]

J. Sched., 2011

A 3/2-approximation algorithm for 3/2-partitioning.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

Batch machine production with perishability time windows and limited batch size.

[BibT_eX]

[DOI]

Konstantin Chakhlevitch

Celia A. Glass

Eur. J. Oper. Res., 2011

Foreword: Combinatorial optimization for industrial engineering.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2011

2010

Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications.

[BibT_eX]

[DOI]

Algorithmica, 2010

Transporting Jobs through a Processing Center with Two Parallel Machines.

[BibT_eX]

[DOI]

Alan J. Soper

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval.

[BibT_eX]

[DOI]

Mikhail A. Kubzin

Vassilissa Lehoux-Lebacque

Eur. J. Oper. Res., 2009

Operator non-availability periods.

[BibT_eX]

[DOI]

Nadia Brauner

Gerd Finke

4OR, 2009

2008

Knapsack.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

2006

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Semi-on-line multiprocessor scheduling with given total processing time.

[BibT_eX]

[DOI]

T. C. Edwin Cheng

Theor. Comput. Sci., 2005

2004

Minimizing the Maximum Lateness.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2004

Algorithms for on-line bin-packing problems with cardinality constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

Knapsack problems.

[BibT_eX]

[DOI]

David Pisinger

Springer, ISBN: 978-3-540-40286-2, 2004

2003

Optimization of cardinality constrained portfolios with a hybrid local search algorithm.

[BibT_eX]

[DOI]

Dietmar Maringer

OR Spectr., 2003

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

Design of tariff zones in public transportation networks: theoretical results and heuristics.

[BibT_eX]

[DOI]

Luitpold Babel

Math. Methods Oper. Res., 2003

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

[BibT_eX]

[DOI]

Renata Mansini

J. Comput. Syst. Sci., 2003

A 3/4-Approximation Algorithm for Multiple Subset Sum.

[BibT_eX]

[DOI]

J. Heuristics, 2003

Scheduling parallel dedicated machines under a single non-shared resource.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Scheduling problems for parallel dedicated machines under multiple resource constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.

[BibT_eX]

[DOI]

T. C. Edwin Cheng

Comput. Sci. J. Moldova, 2003

2002

Approximating Multiobjective Knapsack Problems.

[BibT_eX]

[DOI]

Thomas Erlebach

Manag. Sci., 2002

2001

Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem.

[BibT_eX]

[DOI]

Peter Greistorfer

J. Heuristics, 2001

Approximating Multi-objective Knapsack Problems.

[BibT_eX]

[DOI]

Thomas Erlebach

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Approximation Schemes for Ordered Vector Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

The Multiple Subset Sum Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

A 5/4 Linear Time Bin Packing Algorithm.

[BibT_eX]

[DOI]

József Békési

Gábor Galambos

J. Comput. Syst. Sci., 2000

A PTAS for the Multiple Subset Sum Problem with different knapsack capacities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Two linear approximation algorithms for the subset-sum problem.

[BibT_eX]

[DOI]

Renata Mansini

Eur. J. Oper. Res., 2000

Approximation algorithms for knapsack problems with cardinality constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Selecting Portfolios with Fixed Costs and Minimum Transaction Lots.

[BibT_eX]

[DOI]

Renata Mansini

Ann. Oper. Res., 2000

1999

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.

[BibT_eX]

[DOI]

Thomas Tautenhahn

SIAM J. Comput., 1999

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Cardinality constrained bin‐packing problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1999

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Randomization, 1999

1998

The<i>k</i>-partitioning problem.

[BibT_eX]

[DOI]

Luitpold Babel

Math. Methods Oper. Res., 1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Zsolt Tuza

Inf. Process. Lett., 1998

The Stock Size Problem.

[BibT_eX]

[DOI]

Oper. Res., 1998

A Linear Compound Algorithm for Uniform Machine Scheduling.

[BibT_eX]

[DOI]

Rainer E. Burkard

Y. He

Computing, 1998

A New Fully Polynomial Approximation Scheme for the Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

Semi on-line algorithms for the partition problem.

[BibT_eX]

[DOI]

Zsolt Tuza

Oper. Res. Lett., 1997

An Efficient Approximation Scheme for the Subset-Sum Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1993

A Tight Bound for 3-Partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

On the Euclidean two Paths Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

A Greedy-heuristic for 3-partitioning with similar elements.

[BibT_eX]

[DOI]

Computing, 1993

A Lower Bound for On-Line Vector-Packing Algorithms.

[BibT_eX]

[DOI]

Gábor Galambos

Acta Cybern., 1993

Computing the optimum stock size.

[BibT_eX]

Franz Rendl

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992

The exact LPT-bound for maximizing the minimum completion time.

[BibT_eX]

[DOI]

János Csirik

Oper. Res. Lett., 1992

UET-scheduling with constrained processor allocations.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1992

1991

Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm.

[BibT_eX]

[DOI]

Computing, 1991

1990

Prime covers and periodic patterns.

[BibT_eX]

[DOI]

Günther Wirsching

Discret. Math., 1990

1987

Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4.

[BibT_eX]

Werner Heise