IBL Tool - Digitale Bibliotheek

Digitale Bibliotheek

Tijdschrift beschrijving

Alle jaargangen van het bijbehorende tijdschrift

Alle afleveringen van het bijbehorende jaargang

Alle artikelen van de bijbehorende aflevering

12 gevonden resultaten

nr	titel	auteur	tijdschrift	jaar	jaarg.	afl.	pagina('s)	type
1	Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian	Chiuyuan Chen		2003	7	1	p. 79-86 8 p.	artikel
2	Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian	Chen, Chiuyuan		2003	7	1	p. 79-86	artikel
3	Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups	Adar A. Kalir		2003	7	1	p. 23-44 22 p.	artikel
4	Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups	Kalir, Adar A.		2003	7	1	p. 23-44	artikel
5	Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition	Sachin B. Patkar		2003	7	1	p. 45-68 24 p.	artikel
6	Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition	Patkar, Sachin B.		2003	7	1	p. 45-68	artikel
7	Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models	Eugene Shragowitz		2003	7	1	p. 5-22 18 p.	artikel
8	Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models	Shragowitz, Eugene		2003	7	1	p. 5-22	artikel
9	The Enhanced Double Digest Problem for DNA Physical Mapping	Ming-Yang Kao		2003	7	1	p. 69-78 10 p.	artikel
10	The Enhanced Double Digest Problem for DNA Physical Mapping	Kao, Ming-Yang		2003	7	1	p. 69-78	artikel
11	Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem	Michel Vasquez		2003	7	1	p. 87-103 17 p.	artikel
12	Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem	Vasquez, Michel		2003	7	1	p. 87-103	artikel

12 gevonden resultaten

Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland