sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000116976110 | 1 hits
Person
ISNI: 
0000 0001 1697 6110
Name: 
Jan Karel Lenstra (Mathematician)
Jan Karel Lenstra (Nederlands wiskundige)
Jan Karel Lenstra (niederländischer Mathematiker)
Lenstra, J. K.
Lenstra, Jan K.
Lenstra, Jan Karel
Dates: 
1947-
Creation class: 
article
Computer file
Language material
Manuscript language material
Text
Creation role: 
author
editor
redactor
Related names: 
Aarts, E.H.L. (1955-)
Aarts, Emile Hubertus Leonardus (1955-)
Hazewinkel, Michiel
Hoogeveen, J.A.
Hoogeveen, Johannes Adzer
Kindervater, G.A.P.
Kindervater, Gerardus Antonius Petrus
O'hEigeartaigh, M.
Rinnooy Kan, A. H. G. (1949-)
Rinnooy Kan, A.H.G. (1949-)
Rinnooy Kan, Alexander H. G. (1949-....))
Rinnooy Kan, Alexander H. G. (1949-..)
Rinnooy Kan, Alexander Hendrik George (1949- ))
Rinnooy Kan, Alexander Hendrik George (1949-)
Savelsbergh, M. W. P.
Savelsbergh, M.W.P.
Savelsbergh, Mathieu Willem Paul
University of Amsterdam
Titles: 
appraisal of computational complexity for operations researchers, An
Approximation algorithms for scheduling unrelated parallel machines
Behind the screen : DSS from an or point of view
Branch-and-bound algorithmen voor het handelsreizigersprobleem : voorlopige uitgave.
classification scheme for vehicle routing and scheduling problems, A
Combinatorial optimization : annotated bibliographies
Combinatorics in operations research
Complexity of packing, covering and partitioning problems
complexity of the network design problem, The
Complexity results for scheduling tasks in fixed intervals on two types of machines
Computing
Deterministic and stochastic scheduling : proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems held in Durham, England, July 6-17, 1981
framework for the probabilistic analysis of hierarchical planning systems, A
History of mathematical programming : a collection of personal reminiscences
Interfaces between computer science and operations research : proceedings of a symposium held at the Mathematisch Centrum, Amsterdam, September 7-10, 1976
Job shop scheduling by local search
Kwantitatieve methoden in het management.
Local search in combinatorial optimization
local search template, A : (extended abstract)
machine scheduling with delayed precedence constraints
Mathematics and computer science II : fundamental contributions in the Netherlands since 1945
Minimizing maximum lateness on one machine : algorithms and applications
Minimizing total costs in one-machine scheduling
mystical power of twoness: in memoriam Eugene L. Lawler, The
Mystical Power of Twoness, The : In Memoriam Eugene L Lawler
New directions in scheduling theory
parallel complexity of TSP heuristics, The
Parallel computers and computations
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Recent developments in deterministic sequencing and scheduling : a survey
Recursive algorithms for enumerating subsets, latticepoints, combinations and permutations
Sequencing and scheduling : an annotated bibliography
Sequencing by enumerative methods
Some simple applications of the travelling salesman problem
Technical notes ; on the expected performance of branch-and-bound algorithms
Three, four, five, six, or the complexity of scheduling with communication delays
traveling salesman problem a guided tour of combinatorial optimization, The
Twenty-five years of operations research in the Netherlands : papers dedicated to Gijs de Leve
Wiley-Interscience series in discrete mathematics and optimization
Contributed to or performed: 
JOURNAL OF SCHEDULING
Notes: 
Thesis (doctoral)--University of Amsterdam
Sources: 
VIAF B2Q DNB LAC LC N6I NKC NUKAT SUDOC WKD
BOWKER
DAI
NTA
ZETO