Lenstra, J.K.
Lenstra, J.K. (Jan Karel)
Lenstra, Jan Karel, 1947-....
Lenstra, Jan Karel.
Jan Karel Lenstra Nederlands wiskundige
Lenstra, J.K. (Jan Karel), 1947-
Lenstra, Jan K. 1947-
VIAF ID: 108363903 ( Personal )
Permalink: http://viaf.org/viaf/108363903
Preferred Forms
- 100 0 _ ‡a Jan Karel Lenstra ‡c Nederlands wiskundige
- 200 _ | ‡a Lenstra ‡b Jan Karel ‡f 1947-....
-
- 100 1 _ ‡a Lenstra, J. K.
-
- 100 1 0 ‡a Lenstra, J. K.
- 100 1 _ ‡a Lenstra, J. K.
-
-
-
-
-
- 100 1 _ ‡a Lenstra, Jan K. ‡d 1947-
-
-
- 100 1 _ ‡a Lenstra, Jan Karel, ‡d 1947-....
-
4xx's: Alternate Name Forms (25)
5xx's: Related Names (1)
Works
Title | Sources |
---|---|
An appraisal of computational complexity for operations researchers | |
Approximation algorithms for scheduling unrelated parallel machines | |
Automata, languages and programming : 30th international colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003 : proceedings | |
Behind the screen : DSS from an or point of view | |
Branch-and-bound algorithmen voor het handelsreizigersprobleem : voorlopige uitgave. | |
A Classification scheme for vehicle routing and scheduling problems | |
Complexity of packing, covering and partitioning problems | |
The complexity of the network design problem | |
Complexity results for scheduling tasks in fixed intervals on two types of machines | |
Computational complexity of discrete optimization problems | |
Computing | |
CWI tract | |
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 | |
Deterministic production planning : algorithms and complexity | |
A framework for the probabilistic analysis of hierarchical planning systems | |
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms | |
Handbooks in operations research and management science. | |
A hierarchical clustering scheme for asymmetric matrices | |
History of mathematical programming : a collection of personal reminiscences | |
ICALP 2003 | |
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 | |
Local search in combinatorial optimization | |
A local search template : (extended abstract) | |
machine scheduling with delayed precedence constraints | |
Mathematics and computer science II : fundamental contributions in the Netherlands since 1945 | |
Minimizing maximum lateness in a two-machine open shop | |
The mystical power of twoness: in memoriam Eugene L. Lawler | |
New directions in scheduling theory | |
The parallel complexity of TSP heuristics | |
Parallel computers and computations | |
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard | |
Quantitative methods in management : case studies of failures and successes | |
Recent developments in deterministic sequencing and scheduling : a survey | |
An recursive approach to the implementation of enumerative methods | |
Scheduling subject to resource constraints : classification and complexity | |
Scheduling theory since 1981 : an annotated bibliography | |
Sequencing by enumerative methods | |
Some simple applications of the travelling salesman problem | |
Stochastic integer programming by dynamic programming | |
Technical notes ; on the expected performance of branch-and-bound algorithms | |
Theorie de la complexité de calcul appliqée problèmes de couplage, recouvrement et partitionnement | |
Three, four, five, six, or the complexity of scheduling with communication delays | |
Twenty-five years of operations research in the Netherlands : papers dedicated to Gijs de Leve | |
Wiley-Interscience series in discrete mathematics and optimization |