Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Alexander H. G. Rinnooy Kan
@inproceedings{DBLP:conf/icsm/Kan03,
author = {A. H. G. Rinnooy Kan},
title = {Managing a multi-billion dollar {IT} Budget},
booktitle = {19th International Conference on Software Maintenance {(ICSM} 2003),
The Architecture of Existing Systems, 22-26 September 2003, Amsterdam,
The Netherlands},
pages = {2},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/ICSM.2003.1235400},
doi = {10.1109/ICSM.2003.1235400},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icsm/Kan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KolenKHW94,
author = {Antoon W. J. Kolen and
A. H. G. Rinnooy Kan and
C. P. M. van Hoesel and
Albert P. M. Wagelmans},
title = {Sensitivity Analysis of List Scheduling Heuristics},
journal = {Discret. Appl. Math.},
volume = {55},
number = {2},
pages = {145--162},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90005-1},
doi = {10.1016/0166-218X(94)90005-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/KolenKHW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KarpKV94,
author = {Richard M. Karp and
Alexander H. G. Rinnooy Kan and
Rakesh V. Vohra},
title = {Average Case Analysis of a Heuristic for the Assignment Problem},
journal = {Math. Oper. Res.},
volume = {19},
number = {3},
pages = {513--522},
year = {1994},
url = {https://doi.org/10.1287/moor.19.3.513},
doi = {10.1287/MOOR.19.3.513},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KarpKV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KanSV93,
author = {A. H. G. Rinnooy Kan and
Leen Stougie and
Carlo Vercellis},
title = {A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem},
journal = {Discret. Appl. Math.},
volume = {42},
number = {2},
pages = {279--290},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90051-O},
doi = {10.1016/0166-218X(93)90051-O},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KanSV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FlippoK93,
author = {Olaf E. Flippo and
Alexander H. G. Rinnooy Kan},
title = {Decomposition in general mathematical programming},
journal = {Math. Program.},
volume = {60},
pages = {361--382},
year = {1993},
url = {https://doi.org/10.1007/BF01580620},
doi = {10.1007/BF01580620},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FlippoK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/KanV93,
author = {Alexander H. G. Rinnooy Kan and
A. van Vliet},
title = {Probabilistic Analysis of Packing and Partitioning Algorithms {(E.}
G. Coffman, Jr. and George S. Lueker)},
journal = {{SIAM} Rev.},
volume = {35},
number = {1},
pages = {153--154},
year = {1993},
url = {https://doi.org/10.1137/1035026},
doi = {10.1137/1035026},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/KanV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/93/LawlerLKS93,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
Alexander H. G. Rinnooy Kan and
David B. Shmoys},
editor = {Stephen C. Graves and
Alexander H. G. Rinnooy Kan and
Paul Herbert Zipkin},
title = {Chapter 9 Sequencing and scheduling: Algorithms and complexity},
booktitle = {Logistics of Production and Inventory},
series = {Handbooks in Operations Research and Management Science},
volume = {4},
pages = {445--522},
publisher = {North-Holland},
year = {1993},
url = {https://doi.org/10.1016/s0927-0507(05)80189-6},
doi = {10.1016/S0927-0507(05)80189-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/93/LawlerLKS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/el/93/GravesKZ93,
author = {Stephen C. Graves and
Alexander H. G. Rinnooy Kan and
Paul Herbert Zipkin},
editor = {Stephen C. Graves and
Alexander H. G. Rinnooy Kan and
Paul Herbert Zipkin},
title = {Preface},
booktitle = {Logistics of Production and Inventory},
series = {Handbooks in Operations Research and Management Science},
volume = {4},
pages = {v--vii},
publisher = {North-Holland},
year = {1993},
url = {https://doi.org/10.1016/s0927-0507(05)80180-x},
doi = {10.1016/S0927-0507(05)80180-X},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/93/GravesKZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/el/93/GRZ1993,
editor = {Stephen C. Graves and
Alexander H. G. Rinnooy Kan and
Paul Herbert Zipkin},
title = {Logistics of Production and Inventory},
series = {Handbooks in Operations Research and Management Science},
volume = {4},
publisher = {North-Holland},
year = {1993},
url = {https://doi.org/10.1016/s0927-0507(05)x0180-3},
doi = {10.1016/S0927-0507(05)X0180-3},
isbn = {978-0-444-87472-6},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/el/93/GRZ1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BoenderCMKRSTV91,
author = {C. G. E. Boender and
Richard J. Caron and
J. Fred McDonald and
A. H. G. Rinnooy Kan and
H. Edwin Romeijn and
Robert L. Smith and
Jan Telgen and
A. C. F. Vorst},
title = {Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary
of Bounded Polyhedra},
journal = {Oper. Res.},
volume = {39},
number = {6},
pages = {945--954},
year = {1991},
url = {https://doi.org/10.1287/opre.39.6.945},
doi = {10.1287/OPRE.39.6.945},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BoenderCMKRSTV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CsirikFGK91,
author = {J{\'{a}}nos Csirik and
J. B. G. Frenk and
G{\'{a}}bor Galambos and
A. H. G. Rinnooy Kan},
title = {Probabilistic Analysis of Algorithms for Dual Bin Packing Problems},
journal = {J. Algorithms},
volume = {12},
number = {2},
pages = {189--203},
year = {1991},
url = {https://doi.org/10.1016/0196-6774(91)90001-F},
doi = {10.1016/0196-6774(91)90001-F},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/CsirikFGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BoenderK91,
author = {C. G. E. Boender and
A. H. G. Rinnooy Kan},
title = {On when to stop sampling for the maximum},
journal = {J. Glob. Optim.},
volume = {1},
number = {4},
pages = {331--340},
year = {1991},
url = {https://doi.org/10.1007/BF00130829},
doi = {10.1007/BF00130829},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BoenderK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jim/VlietK91,
author = {Mario van Vliet and
Alexander H. G. Rinnooy Kan},
title = {Machine allocation algorithms for job shop manufacturing},
journal = {J. Intell. Manuf.},
volume = {2},
number = {2},
pages = {83--94},
year = {1991},
url = {https://doi.org/10.1007/BF01471221},
doi = {10.1007/BF01471221},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jim/VlietK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ByrdDKS90,
author = {Richard H. Byrd and
Cornelius L. Dert and
Alexander H. G. Rinnooy Kan and
Robert B. Schnabel},
title = {Concurrent Stochastic Methods for Global Optimization},
journal = {Math. Program.},
volume = {46},
pages = {1--29},
year = {1990},
url = {https://doi.org/10.1007/BF01585724},
doi = {10.1007/BF01585724},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ByrdDKS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/MeantiKSV90,
author = {M. Meanti and
A. H. G. Rinnooy Kan and
Leen Stougie and
Carlo Vercellis},
title = {A Probabilistic Analysis of the Multiknapsack Value Function},
journal = {Math. Program.},
volume = {46},
pages = {237--247},
year = {1990},
url = {https://doi.org/10.1007/BF01585741},
doi = {10.1007/BF01585741},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/MeantiKSV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/AdiriBFK89,
author = {Igal Adiri and
John L. Bruno and
Esther Frostig and
A. H. G. Rinnooy Kan},
title = {Single Machine Flow-Time Scheduling With a Single Breakdown},
journal = {Acta Informatica},
volume = {26},
number = {7},
pages = {679--696},
year = {1989},
url = {https://doi.org/10.1007/BF00288977},
doi = {10.1007/BF00288977},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/AdiriBFK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/KindervaterLK89,
author = {Gerard A. P. Kindervater and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {{OR} Forum - Perspectives on Parallel Computing},
journal = {Oper. Res.},
volume = {37},
number = {6},
pages = {985--990},
year = {1989},
url = {https://doi.org/10.1287/opre.37.6.985},
doi = {10.1287/OPRE.37.6.985},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/KindervaterLK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BruinKT88,
author = {Arie de Bruin and
Alexander H. G. Rinnooy Kan and
Harry W. J. M. Trienekens},
title = {A simulation tool for the performance evaluation of parallel branch
and bound algorithms},
journal = {Math. Program.},
volume = {42},
number = {1-3},
pages = {245--271},
year = {1988},
url = {https://doi.org/10.1007/BF01589406},
doi = {10.1007/BF01589406},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BruinKT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/FrenkHK87,
author = {J. B. G. Frenk and
M. van Houweninge and
Alexander H. G. Rinnooy Kan},
title = {Order statistics and the linear assignment problem},
journal = {Computing},
volume = {39},
number = {2},
pages = {165--174},
year = {1987},
url = {https://doi.org/10.1007/BF02310105},
doi = {10.1007/BF02310105},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/FrenkHK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/KolenKT87,
author = {Antoon W. J. Kolen and
A. H. G. Rinnooy Kan and
Harry W. J. M. Trienekens},
title = {Vehicle Routing with Time Windows},
journal = {Oper. Res.},
volume = {35},
number = {2},
pages = {266--273},
year = {1987},
url = {https://doi.org/10.1287/opre.35.2.266},
doi = {10.1287/OPRE.35.2.266},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/KolenKT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FrenkK87,
author = {J. B. G. Frenk and
A. H. G. Rinnooy Kan},
title = {The Asymptotic Optimality of the {LPT} Rule},
journal = {Math. Oper. Res.},
volume = {12},
number = {2},
pages = {241--254},
year = {1987},
url = {https://doi.org/10.1287/moor.12.2.241},
doi = {10.1287/MOOR.12.2.241},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FrenkK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoenderK87,
author = {C. G. E. Boender and
A. H. G. Rinnooy Kan},
title = {Bayesian stopping rules for multistart global optimization methods},
journal = {Math. Program.},
volume = {37},
number = {1},
pages = {59--80},
year = {1987},
url = {https://doi.org/10.1007/BF02591684},
doi = {10.1007/BF02591684},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BoenderK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BerbeeBKSST87,
author = {H. C. P. Berbee and
C. G. E. Boender and
A. H. G. Rinnooy Kan and
C. L. Scheffer and
Robert L. Smith and
Jan Telgen},
title = {Hit-and-run algorithms for the identification of nonredundant linear
inequalities},
journal = {Math. Program.},
volume = {37},
number = {2},
pages = {184--207},
year = {1987},
url = {https://doi.org/10.1007/BF02591694},
doi = {10.1007/BF02591694},
timestamp = {Wed, 22 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/BerbeeBKSST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KanT87,
author = {Alexander H. G. Rinnooy Kan and
G. T. Timmer},
title = {Stochastic global optimization methods part {I:} Clustering methods},
journal = {Math. Program.},
volume = {39},
number = {1},
pages = {27--56},
year = {1987},
url = {https://doi.org/10.1007/BF02592070},
doi = {10.1007/BF02592070},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KanT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/KanT87a,
author = {Alexander H. G. Rinnooy Kan and
G. T. Timmer},
title = {Stochastic global optimization methods part {II:} Multi level methods},
journal = {Math. Program.},
volume = {39},
number = {1},
pages = {57--78},
year = {1987},
url = {https://doi.org/10.1007/BF02592071},
doi = {10.1007/BF02592071},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/KanT87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kan86,
author = {A. H. G. Rinnooy Kan},
title = {An introduction to the analysis of approximation algorithms},
journal = {Discret. Appl. Math.},
volume = {14},
number = {2},
pages = {171--185},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90059-4},
doi = {10.1016/0166-218X(86)90059-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kan86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FrenkK86,
author = {J. B. G. Frenk and
A. H. G. Rinnooy Kan},
title = {The rate of convergence to optimality of the {LPT} rule},
journal = {Discret. Appl. Math.},
volume = {14},
number = {2},
pages = {187--197},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90060-0},
doi = {10.1016/0166-218X(86)90060-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FrenkK86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Kan85,
author = {A. H. G. Rinnooy Kan},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {10},
number = {2},
pages = {115},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90005-8},
doi = {10.1016/0166-218X(85)90005-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Kan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/FrenkHK85,
author = {J. B. G. Frenk and
M. van Houweninge and
A. H. G. Rinnooy Kan},
title = {Asymptotic Properties of the Quadratic Assignment Problem},
journal = {Math. Oper. Res.},
volume = {10},
number = {1},
pages = {100--116},
year = {1985},
url = {https://doi.org/10.1287/moor.10.1.100},
doi = {10.1287/MOOR.10.1.100},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/FrenkHK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HaimovichK85,
author = {Mordecai Haimovich and
Alexander H. G. Rinnooy Kan},
title = {Bounds and Heuristics for Capacitated Routing Problems},
journal = {Math. Oper. Res.},
volume = {10},
number = {4},
pages = {527--542},
year = {1985},
url = {https://doi.org/10.1287/moor.10.4.527},
doi = {10.1287/MOOR.10.4.527},
timestamp = {Wed, 19 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/HaimovichK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/LenstraKS84,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan and
Leen Stougie},
title = {A framework for the probabilistic analysis of hierarchical planning
systems},
journal = {Ann. Oper. Res.},
volume = {1},
number = {1},
pages = {23--42},
year = {1984},
url = {https://doi.org/10.1007/BF01874450},
doi = {10.1007/BF01874450},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/LenstraKS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/FrenkKS84,
author = {J. B. G. Frenk and
A. H. G. Rinnooy Kan and
Leen Stougie},
title = {A hierarchical scheduling problem with a well-solvable second stage},
journal = {Ann. Oper. Res.},
volume = {1},
number = {1},
pages = {43--58},
year = {1984},
url = {https://doi.org/10.1007/BF01874451},
doi = {10.1007/BF01874451},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/FrenkKS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SpaccamelaKS84,
author = {Alberto Marchetti{-}Spaccamela and
A. H. G. Rinnooy Kan and
Leen Stougie},
title = {Hierarchical vehicle routing problems},
journal = {Networks},
volume = {14},
number = {4},
pages = {571--586},
year = {1984},
url = {https://doi.org/10.1002/net.3230140408},
doi = {10.1002/NET.3230140408},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SpaccamelaKS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/PostmusKT83,
author = {J. T. Postmus and
A. H. G. Rinnooy Kan and
G. T. Timmer},
title = {An Efficient Dynamic Selection Method},
journal = {Commun. {ACM}},
volume = {26},
number = {11},
pages = {878--881},
year = {1983},
url = {https://doi.org/10.1145/182.358440},
doi = {10.1145/182.358440},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/PostmusKT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/DamFK83,
author = {W. B. van Dam and
J. B. G. Frenk and
Alexander H. G. Rinnooy Kan},
title = {The asymptotic behaviour of a distributive sorting method},
journal = {Computing},
volume = {31},
number = {4},
pages = {287--303},
year = {1983},
url = {https://doi.org/10.1007/BF02251234},
doi = {10.1007/BF02251234},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/DamFK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BlazewiczLK83,
author = {Jacek Blazewicz and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Scheduling subject to resource constraints: classification and complexity},
journal = {Discret. Appl. Math.},
volume = {5},
number = {1},
pages = {11--24},
year = {1983},
url = {https://doi.org/10.1016/0166-218X(83)90012-4},
doi = {10.1016/0166-218X(83)90012-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BlazewiczLK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FisherLLK83,
author = {Marshall L. Fisher and
B. J. Lageweg and
Jan Karel Lenstra and
Alexander H. G. Rinnooy Kan},
title = {Surrogate duality relaxation for job shop scheduling},
journal = {Discret. Appl. Math.},
volume = {5},
number = {1},
pages = {65--75},
year = {1983},
url = {https://doi.org/10.1016/0166-218X(83)90016-1},
doi = {10.1016/0166-218X(83)90016-1},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/FisherLLK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BakerLLK83,
author = {K. R. Baker and
Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Preemptive Scheduling of a Single Machine to Minimize Maximum Cost
Subject to Release Dates and Precedence Constraints},
journal = {Oper. Res.},
volume = {31},
number = {2},
pages = {381--386},
year = {1983},
url = {https://doi.org/10.1287/opre.31.2.381},
doi = {10.1287/OPRE.31.2.381},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/BakerLLK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DempsterFJLLK83,
author = {M. A. H. Dempster and
Marshall L. Fisher and
L. Jansen and
B. J. Lageweg and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Analysis of Heuristics for Stochastic Programming: Results for Hierarchical
Scheduling Problems},
journal = {Math. Oper. Res.},
volume = {8},
number = {4},
pages = {525--537},
year = {1983},
url = {https://doi.org/10.1287/moor.8.4.525},
doi = {10.1287/MOOR.8.4.525},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DempsterFJLLK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Kan83,
author = {Alexander H. G. Rinnooy Kan},
title = {Capacity expansion - analysis of simple models with applications,
by John Freidenfels, North Holland, 1981, 291 pp. Price: {\textdollar}39.50},
journal = {Networks},
volume = {13},
number = {2},
pages = {303},
year = {1983},
url = {https://doi.org/10.1002/net.3230130213},
doi = {10.1002/NET.3230130213},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Kan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/LagewegLK82,
author = {B. J. Lageweg and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Computer-Aided Complexity Classification of Combinatorial Problems},
journal = {Commun. {ACM}},
volume = {25},
number = {11},
pages = {817--822},
year = {1982},
url = {https://doi.org/10.1145/358690.363066},
doi = {10.1145/358690.363066},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/LagewegLK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LawlerLK82,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Erratum},
journal = {Math. Oper. Res.},
volume = {7},
number = {4},
pages = {635},
year = {1982},
url = {https://doi.org/10.1287/moor.7.4.635},
doi = {10.1287/MOOR.7.4.635},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/LawlerLK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BoenderKTS82,
author = {C. G. E. Boender and
A. H. G. Rinnooy Kan and
G. T. Timmer and
Leen Stougie},
title = {A stochastic method for global optimization},
journal = {Math. Program.},
volume = {22},
number = {1},
pages = {125--140},
year = {1982},
url = {https://doi.org/10.1007/BF01581033},
doi = {10.1007/BF01581033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BoenderKTS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CarlierK82,
author = {J. Carlier and
A. H. G. Rinnooy Kan},
title = {Scheduling subject to nonrenewable-resource constraints},
journal = {Oper. Res. Lett.},
volume = {1},
number = {2},
pages = {52--55},
year = {1982},
url = {https://doi.org/10.1016/0167-6377(82)90045-1},
doi = {10.1016/0167-6377(82)90045-1},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CarlierK82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/DempsterFJLLK81,
author = {Michael A. H. Dempster and
Marshall L. Fisher and
L. Jansen and
B. J. Lageweg and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Analytical Evaluation of Hierarchical Planning Systems},
journal = {Oper. Res.},
volume = {29},
number = {4},
pages = {707--716},
year = {1981},
url = {https://doi.org/10.1287/opre.29.4.707},
doi = {10.1287/OPRE.29.4.707},
timestamp = {Thu, 28 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/DempsterFJLLK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/LawlerLK81,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Minimizing Maximum Lateness in a Two-Machine Open Shop},
journal = {Math. Oper. Res.},
volume = {6},
number = {1},
pages = {153--158},
year = {1981},
url = {https://doi.org/10.1287/moor.6.1.153},
doi = {10.1287/MOOR.6.1.153},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/LawlerLK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LenstraK81,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Complexity of vehicle routing and scheduling problems},
journal = {Networks},
volume = {11},
number = {2},
pages = {221--227},
year = {1981},
url = {https://doi.org/10.1002/net.3230110211},
doi = {10.1002/NET.3230110211},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/LenstraK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LawlerLK80,
author = {Eugene L. Lawler and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time
Algorithms},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {3},
pages = {558--565},
year = {1980},
url = {https://doi.org/10.1137/0209042},
doi = {10.1137/0209042},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LawlerLK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LenstraK78,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Complexity of Scheduling under Precedence Constraints},
journal = {Oper. Res.},
volume = {26},
number = {1},
pages = {22--35},
year = {1978},
url = {https://doi.org/10.1287/opre.26.1.22},
doi = {10.1287/OPRE.26.1.22},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LenstraK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LagewegLK78,
author = {B. J. Lageweg and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {A General Bounding Scheme for the Permutation Flow-Shop Problem},
journal = {Oper. Res.},
volume = {26},
number = {1},
pages = {53--67},
year = {1978},
url = {https://doi.org/10.1287/opre.26.1.53},
doi = {10.1287/OPRE.26.1.53},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LagewegLK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/LenstraK78a,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {Technical Note - On the Expected Performance of Branch-and-Bound Algorithms},
journal = {Oper. Res.},
volume = {26},
number = {2},
pages = {347--349},
year = {1978},
url = {https://doi.org/10.1287/opre.26.2.347},
doi = {10.1287/OPRE.26.2.347},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/LenstraK78a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/JohnsonLK78,
author = {David S. Johnson and
Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {The complexity of the network design problem},
journal = {Networks},
volume = {8},
number = {4},
pages = {279--285},
year = {1978},
url = {https://doi.org/10.1002/net.3230080402},
doi = {10.1002/NET.3230080402},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/JohnsonLK78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Kan76,
author = {A. H. G. Rinnooy Kan},
title = {Technical Note - On Mitten's Axioms for Branch-and-Bound},
journal = {Oper. Res.},
volume = {24},
number = {6},
pages = {1176--1178},
year = {1976},
url = {https://doi.org/10.1287/opre.24.6.1176},
doi = {10.1287/OPRE.24.6.1176},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Kan76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/LenstraK76,
author = {Jan Karel Lenstra and
A. H. G. Rinnooy Kan},
title = {On general routing problems},
journal = {Networks},
volume = {6},
number = {3},
pages = {273--280},
year = {1976},
url = {https://doi.org/10.1002/net.3230060305},
doi = {10.1002/NET.3230060305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/LenstraK76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/KanLL75,
author = {A. H. G. Rinnooy Kan and
B. J. Lageweg and
Jan Karel Lenstra},
title = {Minimizing Total Costs in One-Machine Scheduling},
journal = {Oper. Res.},
volume = {23},
number = {5},
pages = {908--927},
year = {1975},
url = {https://doi.org/10.1287/opre.23.5.908},
doi = {10.1287/OPRE.23.5.908},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/KanLL75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-30 00:39 CEST 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:
