Search results for "Jan Karel Lenstra"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Jan Karel Lenstra	Editorial.	Oper. Res. Lett.	2012	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger	Preface.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	J. M. Spitter, Cor A. J. Hurkens, Ton G. de Kok, Jan Karel Lenstra, Ebbe G. Negenman	Linear programming models with planned lead times for supply chain operations planning.	European Journal of Operational Research	2005	DBLP DOI BibTeX RDF
1	Ann Vandevelde, Han Hoogeveen, Cor A. J. Hurkens, Jan Karel Lenstra	Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.	INFORMS Journal on Computing	2005	DBLP DOI BibTeX RDF
1	Wenci Yu, Han Hoogeveen, Jan Karel Lenstra	Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.	J. Scheduling	2004	DBLP DOI BibTeX RDF	intermediate delays, strong NP-hardness, computational complexity, makespan, flow shop scheduling
1	Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie	Computer-Aided Complexity Classification of Dial-a-Ride Problems.	INFORMS Journal on Computing	2004	DBLP DOI BibTeX RDF
1	Tjark Vredeveld, Jan Karel Lenstra	On local search for the generalized graph coloring problem.	Oper. Res. Lett.	2003	DBLP DOI BibTeX RDF
1	Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie	Approximation algorithms for the test cover problem.	Math. Program.	2003	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger (eds.)	Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings	ICALP	2003	DBLP BibTeX RDF
1	Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine	Algorithms for Radio Link Frequency Assignment: The Calma Project.	Operations Research	2002	DBLP DOI BibTeX RDF
1	Koen M. J. De Bontridder, B. J. Lageweg, Jan Karel Lenstra, James B. Orlin, Leen Stougie	Branch-and-Bound Algorithms for the Test Cover Problem.	ESA	2002	DBLP DOI BibTeX RDF
1	Sergey R. Tiourine, Cor A. J. Hurkens, Jan Karel Lenstra	Local search algorithms for the radio link frequency assignment problem.	Telecommunication Systems	2000	DBLP DOI BibTeX RDF
1	Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra	A local search template.	Computers & OR	1998	DBLP DOI BibTeX RDF
1	Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra	Scheduling Periodic Tasks with Slack.	INFORMS Journal on Computing	1997	DBLP BibTeX RDF
1	Jan Karel Lenstra, Marinus Veldhorst, Bart Veltman	The Complexity of Scheduling Trees with Communication Delays.	J. Algorithms	1996	DBLP DOI BibTeX RDF
1	Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra	Scheduling Periodic Tasks.	INFORMS Journal on Computing	1996	DBLP DOI BibTeX RDF
1	Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra	Job Shop Scheduling by Local Search.	INFORMS Journal on Computing	1996	DBLP DOI BibTeX RDF
1	Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels	Periodic Assignment and Graph Colouring.	Discrete Applied Mathematics	1994	DBLP DOI BibTeX RDF
1	Emile H. L. Aarts, Peter J. M. van Laarhoven, Jan Karel Lenstra, Nico L. J. Ulder	A Computational Study of Local Search Algorithms for Job Shop Scheduling.	INFORMS Journal on Computing	1994	DBLP DOI BibTeX RDF
1	Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh	Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem.	Discrete Applied Mathematics	1993	DBLP DOI BibTeX RDF
1	Jan Karel Lenstra, Marinus Veldhorst	The Complexity of Scheduling Trees with Communication Delays (Extended Abstract).	ESA	1993	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Jan Karel Lenstra	Guest Editors' Introduction.	INFORMS Journal on Computing	1992	DBLP DOI BibTeX RDF
1	Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra	A Local Search Template.	PPSN	1992	DBLP BibTeX RDF
1	Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels	Periodic Multiprocessor Scheduling.	PARLE	1991	DBLP DOI BibTeX RDF	periodic assignment, nonpreemptive scheduling, cyclic scheduling, periodic scheduling
1	Bart Veltman, B. J. Lageweg, Jan Karel Lenstra	Multiprocessor scheduling with communication delays.	Parallel Computing	1990	DBLP DOI BibTeX RDF
1	Jan Karel Lenstra, David B. Shmoys, Éva Tardos	Approximation Algorithms for Scheduling Unrelated Parallel Machines.	Math. Program.	1990	DBLP DOI BibTeX RDF
1	Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys	The Parallel Complexity of TSP Heuristics.	J. Algorithms	1989	DBLP DOI BibTeX RDF
1	Jan Karel Lenstra, David B. Shmoys, Éva Tardos	Approximation Algorithms for Scheduling Unrelated Parallel Machines	FOCS	1987	DBLP DOI BibTeX RDF
1	B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan	Computer-Aided Complexity Classification of Combinatorial Problems.	Commun. ACM	1982	DBLP DOI BibTeX RDF
1	Katsuto Nakajima, S. Louis Hakimi, Jan Karel Lenstra	Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines.	SIAM J. Comput.	1982	DBLP DOI BibTeX RDF
1	Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan	Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF

Publications of "Jan Karel Lenstra" ( http://dblp.L3S.de/Authors/Jan_Karel_Lenstra )