default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Kellerer
Johannes Kellerer
Person information
- affiliation: Universität Graz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Imed Kacem, Hans Kellerer
:
Minimizing the maximum lateness for scheduling with release times and job rejection. J. Comb. Optim. 48(3): 23 (2024)- 2023
- [j73]Stanislaw Gawiejnowicz, Nir Halman, Hans Kellerer:
Knapsack problems with position-dependent item weights or profits. Ann. Oper. Res. 326(1): 137-156 (2023) - [j72]Hans Kellerer, Vitaly A. Strusevich:
The two-flight low risk helicopter transportation problem under the split pickup scenario. EURO J. Transp. Logist. 12: 100115 (2023) - 2021
- [j71]Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub:
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298(1): 1-5 (2021) - [j70]György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza:
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. Theor. Comput. Sci. 880: 69-81 (2021) - 2020
- [c15]Martin Gutjahr, Hans Kellerer, Sophie N. Parragh:
Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system. ISM 2020: 825-832
2010 – 2019
- 2019
- [j69]Imed Kacem, Hans Kellerer:
Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discret. Appl. Math. 264: 76-89 (2019) - [j68]György Dósa, Hans Kellerer, Zsolt Tuza:
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1): 160-169 (2019) - [j67]György Dósa, Hans Kellerer, Zsolt Tuza:
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760: 72-87 (2019) - 2018
- [j66]Imed Kacem, Hans Kellerer:
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Algorithmica 80(12): 3825-3843 (2018) - [j65]Nir Halman, Hans Kellerer, Vitaly A. Strusevich:
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints. Eur. J. Oper. Res. 270(2): 435-447 (2018) - [c14]Imed Kacem, Hans Kellerer:
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ICCL 2018: 417-427 - [c13]György Dósa, Hans Kellerer, Zsolt Tuza:
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. WAOA 2018: 204-217 - 2017
- [j64]Hans Kellerer, Rebecca Sarto Basso, Vitaly A. Strusevich:
Approximability issues for unconstrained and constrained maximization of half-product related functions. Theor. Comput. Sci. 659: 64-71 (2017) - [i1]Imed Kacem, Hans Kellerer:
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints. CoRR abs/1708.05102 (2017) - 2016
- [j63]Hans Kellerer, Vitaly A. Strusevich:
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann. Oper. Res. 240(1): 39-94 (2016) - [j62]Imed Kacem, Hans Kellerer, Maryam Seifaddini:
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim. 32(3): 970-981 (2016) - [j61]Imed Kacem, Hans Kellerer, Pierre Laroche:
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50(4-5): 677-679 (2016) - [j60]Imed Kacem, Hans Kellerer:
Semi-online scheduling on a single machine with unexpected breakdown. Theor. Comput. Sci. 646: 40-48 (2016) - [r3]Hans Kellerer:
Knapsack. Encyclopedia of Algorithms 2016: 1048-1051 - 2015
- [j59]Imed Kacem, Hans Kellerer, Yann Lanuel:
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J. Comb. Optim. 30(3): 403-412 (2015) - [j58]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j57]Hans Kellerer, Vladimir Kotov, Michaël Gabay:
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18(6): 623-630 (2015) - [j56]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - 2014
- [j55]Armin Eichinger, Johannes Kellerer:
Between laboratory and simulator: a cognitive approach to evaluating cockpit interfaces by manipulating informatory context. Cogn. Technol. Work. 16(3): 417-427 (2014) - [j54]Imed Kacem, Hans Kellerer:
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 164: 154-160 (2014) - [c12]Imed Kacem, Hans Kellerer, Maryam Seifaddini:
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ISCO 2014: 305-314 - 2013
- [j53]Hans Kellerer, Vitaly A. Strusevich:
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product. Eur. J. Oper. Res. 228(1): 24-32 (2013) - [j52]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Preemptive scheduling on two identical parallel machines with a single transporter. J. Comb. Optim. 25(2): 279-307 (2013) - [j51]Hans Kellerer, Vladimir Kotov:
An efficient algorithm for bin stretching. Oper. Res. Lett. 41(4): 343-346 (2013) - [j50]Hans Kellerer, Kabir Rustogi, Vitaly A. Strusevich:
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. J. Sched. 16(6): 675-683 (2013) - 2012
- [j49]Hans Kellerer, Vitaly A. Strusevich:
The symmetric quadratic knapsack problem: approximation and scheduling applications. 4OR 10(2): 111-161 (2012) - [j48]Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici:
Parallel dedicated machines scheduling with chain precedence constraints. Eur. J. Oper. Res. 221(2): 296-305 (2012) - [j47]T. C. E. Cheng, Hans Kellerer, Vladimir Kotov:
Algorithms better than LPT for semi-online scheduling with decreasing processing times. Oper. Res. Lett. 40(5): 349-352 (2012) - [c11]Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici:
Scheduling Two Chains on Parallel Dedicated Machines. CTW 2012: 9-12 - [c10]János Balogh, József Békési, György Dósa, Hans Kellerer, Zsolt Tuza:
Black and White Bin Packing. WAOA 2012: 131-144 - 2011
- [j46]Imed Kacem, Hans Kellerer:
Foreword: Combinatorial optimization for industrial engineering. Comput. Ind. Eng. 61(2): 239-241 (2011) - [j45]Konstantin Chakhlevitch, Celia A. Glass, Hans Kellerer:
Batch machine production with perishability time windows and limited batch size. Eur. J. Oper. Res. 210(1): 39-47 (2011) - [j44]Hans Kellerer, Vladimir Kotov:
A 3/2-approximation algorithm for 3/2-partitioning. Oper. Res. Lett. 39(5): 359-362 (2011) - [j43]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. Sched. 14(3): 257-265 (2011) - 2010
- [j42]Hans Kellerer, Vitaly A. Strusevich:
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications. Algorithmica 57(4): 769-795 (2010) - [j41]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. 21(3): 357-383 (2010) - [c9]Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
Transporting Jobs through a Processing Center with Two Parallel Machines. COCOA (1) 2010: 408-422
2000 – 2009
- 2009
- [j40]Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich:
Operator non-availability periods. 4OR 7(3): 239-253 (2009) - [j39]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. Eur. J. Oper. Res. 199(1): 111-116 (2009) - 2008
- [j38]Hans Kellerer:
An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. Oper. Res. Lett. 36(2): 157-159 (2008) - [r2]Hans Kellerer:
Knapsack. Encyclopedia of Algorithms 2008 - 2006
- [j37]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. 369(1-3): 230-238 (2006) - 2005
- [j36]T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Semi-on-line multiprocessor scheduling with given total processing time. Theor. Comput. Sci. 337(1-3): 134-146 (2005) - 2004
- [b1]Hans Kellerer, Ulrich Pferschy, David Pisinger:
Knapsack problems. Springer 2004, ISBN 978-3-540-40286-2, pp. I-XX, 1-546 - [j35]Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov:
Algorithms for on-line bin-packing problems with cardinality constraints. Discret. Appl. Math. 143(1-3): 238-251 (2004) - [j34]Hans Kellerer, Ulrich Pferschy:
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. J. Comb. Optim. 8(1): 5-11 (2004) - [r1]Hans Kellerer:
Minimizing the Maximum Lateness. Handbook of Scheduling 2004 - 2003
- [j33]T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov:
Lower Bounds and Semi On-line Multiprocessor Scheduling. Comput. Sci. J. Moldova 11(2): 209-228 (2003) - [j32]Hans Kellerer, Vitaly A. Strusevich:
Scheduling problems for parallel dedicated machines under multiple resource constraints. Discret. Appl. Math. 133(1-3): 45-68 (2003) - [j31]Hans Kellerer, Vitaly A. Strusevich:
Scheduling parallel dedicated machines under a single non-shared resource. Eur. J. Oper. Res. 147(2): 345-364 (2003) - [j30]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003) - [j29]Hans Kellerer, Renata Mansini, Ulrich Pferschy, Maria Grazia Speranza:
An efficient fully polynomial approximation scheme for the Subset-Sum Problem. J. Comput. Syst. Sci. 66(2): 349-370 (2003) - [j28]Luitpold Babel, Hans Kellerer:
Design of tariff zones in public transportation networks: theoretical results and heuristics. Math. Methods Oper. Res. 58(3): 359-374 (2003) - [j27]Hans Kellerer, Vladimir Kotov:
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Oper. Res. Lett. 31(1): 35-41 (2003) - [j26]Dietmar Maringer, Hans Kellerer:
Optimization of cardinality constrained portfolios with a hybrid local search algorithm. OR Spectr. 25(4): 481-495 (2003) - 2002
- [j25]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multiobjective Knapsack Problems. Manag. Sci. 48(12): 1603-1612 (2002) - 2001
- [j24]Peter Greistorfer, Hans Kellerer:
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. J. Heuristics 7(4): 371-390 (2001) - [c8]Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov:
On-Line Algorithms for Cardinality Constrained Bin Packing Problems. ISAAC 2001: 695-706 - [c7]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74 - [c6]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221 - 2000
- [j23]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Selecting Portfolios with Fixed Costs and Minimum Transaction Lots. Ann. Oper. Res. 99(1-4): 287-304 (2000) - [j22]Hans Kellerer, Renata Mansini, Maria Grazia Speranza:
Two linear approximation algorithms for the subset-sum problem. Eur. J. Oper. Res. 120(2): 289-296 (2000) - [j21]Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger:
Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2): 333-345 (2000) - [j20]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000) - [j19]József Békési, Gábor Galambos, Hans Kellerer:
A 5/4 Linear Time Bin Packing Algorithm. J. Comput. Syst. Sci. 60(1): 145-160 (2000) - [j18]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
The Multiple Subset Sum Problem. SIAM J. Optim. 11(2): 308-319 (2000)
1990 – 1999
- 1999
- [j17]Hans Kellerer, Ulrich Pferschy:
Cardinality constrained bin‐packing problems. Ann. Oper. Res. 92: 335-348 (1999) - [j16]Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. J. Comb. Optim. 3(1): 59-71 (1999) - [j15]Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. SIAM J. Comput. 28(4): 1155-1166 (1999) - [c5]Hans Kellerer:
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. RANDOM-APPROX 1999: 51-62 - 1998
- [j14]Rainer E. Burkard, Y. He, Hans Kellerer:
A Linear Compound Algorithm for Uniform Machine Scheduling. Computing 61(1): 1-10 (1998) - [j13]Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger:
The Stock Size Problem. Oper. Res. 46(3-Supplement-3): S1-S12 (1998) - [j12]Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza:
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65(5): 229-233 (1998) - [j11]Luitpold Babel, Hans Kellerer, Vladimir Kotov:
Thek-partitioning problem. Math. Methods Oper. Res. 47(1): 59-82 (1998) - [c4]Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. APPROX 1998: 123-134 - 1997
- [j10]Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza:
Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5): 235-242 (1997) - [c3]Hans Kellerer, Ulrich Pferschy, Maria Grazia Speranza:
An Efficient Approximation Scheme for the Subset-Sum Problem. ISAAC 1997: 394-403 - 1996
- [c2]Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger:
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. STOC 1996: 418-426 - 1993
- [j9]Gábor Galambos, Hans Kellerer, Gerhard J. Woeginger:
A Lower Bound for On-Line Vector-Packing Algorithms. Acta Cybern. 11(1-2): 23-34 (1993) - [j8]Hans Kellerer, Gerhard J. Woeginger:
A Greedy-heuristic for 3-partitioning with similar elements. Computing 50(3): 271-278 (1993) - [j7]Hans Kellerer, Gerhard J. Woeginger:
A Tight Bound for 3-Partitioning. Discret. Appl. Math. 45(3): 249-259 (1993) - [j6]Hans Kellerer, Gerhard J. Woeginger:
On the Euclidean two Paths Problem. Discret. Appl. Math. 47(2): 165-173 (1993) - [c1]Hans Kellerer, Franz Rendl, Gerhard J. Woeginger:
Computing the optimum stock size. IPCO 1993: 147-159 - 1992
- [j5]Hans Kellerer, Gerhard J. Woeginger:
UET-scheduling with constrained processor allocations. Comput. Oper. Res. 19(1): 1-8 (1992) - [j4]János Csirik, Hans Kellerer, Gerhard J. Woeginger:
The exact LPT-bound for maximizing the minimum completion time. Oper. Res. Lett. 11(5): 281-287 (1992) - 1991
- [j3]Hans Kellerer:
Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm. Computing 46(3): 183-191 (1991) - 1990
- [j2]Hans Kellerer, Günther Wirsching:
Prime covers and periodic patterns. Discret. Math. 85(2): 191-206 (1990)
1980 – 1989
- 1987
- [j1]Werner Heise, Hans Kellerer:
Eine Verschärfung der Quadratwurzel-Schranke für Quadratische-Rest-Codes einer Länge n = -1 mod 4. J. Inf. Process. Cybern. 23(2/3): 113-124 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
