Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde en Systeemtheorie
Voortgez. als: Centrum voor Wiskunde en Informatica, Amsterdam. Department of Operations Research and System Theory
| schema:name | "Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde en Systeemtheorie" |
| schema:description | "Voortgez. als: Centrum voor Wiskunde en Informatica, Amsterdam. Department of Operations Research and System Theory"@nl |
| "Voortz. van: Stichting Mathematisch Centrum, Amsterdam. Afdeling Mathematische Besliskunde"@nl | |
|
schema:main |
<http:/ |
|
<https:/ |
|
|
rdfs:see |
Centrum voor Wiskunde en Informatica (Amsterdam). Department of Operations Research and System Theory |
| Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde | |
|
schema:dissolution |
"" |
|
schema:founding |
"" |
| schema:location |
<https:/ |
|
schema:parent |
Stichting Mathematisch Centrum (Amsterdam) |
Inverse relations
[ .. ] → schema:author → Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde en Systeemtheorie
A framework for the probabilistic analysis of hierarchical planning systems / J.K. Lenstra, A.H.G. Rinnooy Kan, L. Stougieschema:ProductModel
A note on Delbrouck's approximate solution to the heterogeneous blocking problem / by E.A. van Doornschema:ProductModel
A note on the expected performance of branch-and-bound algorithms / J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
A note on the overflow process from a finite Markovian queue / E.A. van Doornschema:ProductModel
A recursive approach to the generation of combinatorial configurations / J.K. Lenstra [and] A.H.G. Rinnooy Kanschema:ProductModel
An introduction to multiprocessor scheduling / J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
An recursive approach to the implementation of enumerative methods / J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
Complexity of machine scheduling problems / P. Brucker, J.K. Lenstra [and] A.H.G. Rinnooy Kanschema:ProductModel
Complexity of vehicle routing and scheduling problems / J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
Complexity results for scheduling chains on a single machine / J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
Computational complexity of discrete optimization problems / J.K. Lenstra, A.H.G. Rinnooij Kanschema:ProductModel
Connectivity of circulant digraphs / E.A. van Doornschema:ProductModel
Current algebras and the identification problem / P.S. Krishnaprasad, S.I. Marcus & M. Hazewinkelschema:ProductModel
Deterministic production planning : algorithms and complexity / M. Florian, J.K. Lenstra, A.H.G. Rinnooy Kanschema:ProductModel
Invariance properties of the conditional independence relation / by C. van Putten, J.H. van Schuppenschema:ProductModel
Nonexistence of finite dimensional filters for conditional statistics of the cubic sensor problem / M. Hazewinkel, S.I. Marcus & H.J. Sussmannschema:ProductModel
On general routing problems / door J.K. Lenstra en A.H.G. Rinnooy Kanschema:ProductModel
On orthogonal polynomials on a half line and the associated kernel polynomials / E.A. van Doornschema:ProductModel
On the weak finite stochastic realization problem / G. Picci & J.H. van Schuppenschema:ProductModel
Optimal control of partially observable stochastic systems with an exponential-of-integral performance index / A. Bensoussan & J.H. van Schuppenschema:ProductModel
... show all 33
[ .. ] → rdfs:seeAlso → Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde en Systeemtheorie
[ .. ] → schema:contributor → Stichting Mathematisch Centrum (Amsterdam). Afdeling Mathematische Besliskunde en Systeemtheorie
Minimizing maximum lateness on one machine : computational experience and some applications / by B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kanschema:ProductModel
Symmetric systems with semi-simple structure algebra : the quarternionic case / M. Hazewinkel, J.H. Lewis & C. Martinschema:ProductModel