Journal article
  Becchetti, L., Korteweg, P., Marchetti Spaccamela, A., Skutella, M., Stougie, L. & Vitaletti, A. (2010). Latency constrained aggregation in sensor networks. ACM Transactions on Algorithms, 6(1:13), 1-20.

  Acuña, V., Chierichetti, F., Lacroix, V., Marchetti Spaccamela, A., Sagot, M.F. & Stougie, L. (2009). Modes and cuts in metabolic networks : complexity and algorithms. Biosystems, 95(1), 51-60.

  Bonifaci, V. & Stougie, L. (2009). Online k-server routing problems. Theory of Computing Systems, 45(3), 470-485.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L., Hagen, F. & Boekhout, T. (2009). Constructing level-2 phylogenetic networks from triplets. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(4), 667-681.

  Korteweg, P., Marchetti Spaccamela, A., Stougie, L. & Vitaletti, A. (2009). Data aggregation in sensor networks : balancing communication and delay costs. Theoretical Computer Science, 410(4), 1346-1354.

  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2008). An approximation algorithm for the Wireless Gathering Problem. Operations Research Letters, 36(5), 605-608.

  Cryan, M., Dyer, M., Müller, H. & Stougie, L. (2008). Random walks on the vertices of transportation polytopes with constant number of sources. Random Structures and Algorithms, 33(3), 333-355.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M. & Stougie, L. (2008). Shorelines of islands of tractability : algorithms for parsimony and minimum perfect phylogeny haplotyping problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2), 301-312.

  Krumke, S.O., Paepe, W.E. de, Rambau, J. & Stougie, L. (2008). Bincoloring. Theoretical Computer Science, 407(1-3), 231-241.

  Schütz, P., Stougie, L. & Tomasgard, A. (2008). Stochastic facility location with general long-run costs and convex short-run costs. Computers & Operations Research, 35(9), 2988-3000.

  Hurkens, C.A.J., Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L. & Tromp, J.T. (2007). Prefix reversals on binary and ternary strings. SIAM Journal on Discrete Mathematics, 21(3), 592-611.

  Hurkens, C.A.J., Keijsper, J.C.M. & Stougie, L. (2007). Virtual private network design : a proof of the tree routing conjecture on ring networks. SIAM Journal on Discrete Mathematics, 21(2), 482-503.

  Brightwell, G., Heuvel, J. van den & Stougie, L. (2006). A linear bound on the diameter of the transportation polytope. Combinatorica, 26(2), 133-139.

  Broek, J.J.J. van den, Schütz, P., Stougie, L. & Tomasgard, A. (2006). Location of slaughterhouses under economies of scale. European Journal of Operational Research, 175(2), 740-750.

  Dyer, M. & Stougie, L. (2006). Computational complexity of stochastic programming problems. Mathematical Programming, 106(3), 423-432.

  Keijsper, J.C.M., Pendavingh, R.A. & Stougie, L. (2006). A linear programming formulation of Mader's edge-disjoint paths problem. Journal of Combinatorial Theory, Series B, 96(1), 159-163.

  Klein Haneveld, W.K., Stougie, L. & Vlerk, M.H. van der (2006). Simple integer recourse models : convexity and convex approximations. Mathematical Programming, 108(2-3), 435-473.

  Krumke, S.O., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2006). Erratum to "News from the online travelling repairman" [TCS 295(1-3) (2003) 279-294]. Theoretical Computer Science, 352(1-3), 347-348.

  Sitters, R.A. & Stougie, L. (2006). The generalized two-server problem. Journal of the ACM, 53(3), 437-458.

  Lipmann, M., Lu, X., Paepe, W.E. de, Sitters, R.A. & Stougie, L. (2004). On-line dial-a-ride problems under a restricted information model. Algorithmica, 40(4), 319-329.

  Paepe, W.E. de, Lenstra, J.K., Sgall, J., Sitters, R.A. & Stougie, L. (2004). Computer-aided complexity classification of dial-a-ride problems. INFORMS Journal on Computing, 16(2), 120-132.

  Bontridder, K.M.J. de, Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R. & Stougie, L. (2003). Approximation algorithms for the test cover problem. Mathematical Programming, 98(1-3), 477-491.

  Dye, S., Stougie, L. & Tomasgard, A. (2003). Approximation algorithms and relaxations for a service provision problem on a telecommunication network. Discrete Applied Mathematics, 129(1), 63-81.

  Dye, S., Stougie, L. & Tomasgard, A. (2003). The stochastic single resource service-provision problem. Naval Research Logistics, 50(8), 869-887.

  Feuerstein, E., Mydlarz, M. & Stougie, L. (2003). On-line multi-threaded scheduling. Journal of Scheduling, 6(2), 167-181.

  Krumke, S.O., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2003). News from the online travelling repairman. Theoretical Computer Science, 295(1-3), 279-294.

  Lu, X., Sitters, R.A. & Stougie, L. (2003). A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters, 31(3), 232-236.

  Stougie, L. & Vestjens, A.P.A. (2002). Randomized algorithms for on-line scheduling problems : how low can't you go?. Operations Research Letters, 30(2), 89-96.

  Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L. & Talamo, M. (2001). Algorithms for the on-line travelling salesman. Algorithmica, 29(4), 560-581.

  Blom, M., Krumke, S.O., Paepe, W.E. de & Stougie, L. (2001). The online TSP against fair adversaries. INFORMS Journal on Computing, 13(2), 138-148.

  Feuerstein, E. & Stougie, L. (2001). On-line single server dial-a-ride problems. Theoretical Computer Science, 268(1), 91-105.

  Bartal, Y., Leonardi, S., Marchetti Spaccamela, A., Sgall, J. & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal on Discrete Mathematics, 13(1), 64-78.

  Desrochers, M., Jones, C.V., Lenstra, J.K., Savelsbergh, M.W.P. & Stougie, L. (1999). Towards a model and algorithm management system for vehicle routing and scheduling problems. Decision Support Systems, 25(2), 109-133.

  Stougie, L. (1999). Introducing the paper by Aardal and van Hoesel. Statistica Neerlandica, 53(2), 129-130.

  Schultz, R., Stougie, L. & Vlerk, M.H. van der (1998). Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions. Mathematical Programming, 83, 229-252.

  Tomasgard, A., Audestad, J.A., Dye, S., Stougie, L., Vlerk, M.H. van der & Wallace, S.W. (1998). Modelling aspects in distributed processing telecommunications network. Annals of Operations Research, 82, 161-184.

  Klein Haneveld, W.K., Stougie, L. & Vlerk, M.H. van der (1996). An algorithm for the construction of convex hulls in simple integer recourse programming. Annals of Operations Research, 64(1), 67-81.

  Schultz, R., Stougie, L. & Vlerk, M.H. van der (1996). Two-stage stochastic integer programming : a survey. Statistica Neerlandica, 50(3), 404-416.

  Klein Haneveld, W.K., Stougie, L. & Vlerk, M.H. van der (1995). On the convex hull of the simple integer recourse objective function. Annals of Operations Research, 56, 209-224.

  Rinnooy Kan, A.H.G., Stougie, L. & Vercellis, C. (1993). A class of generalized greedy algorithms for the multi-knapsack problem. Discrete Applied Mathematics, 42(2-3), 279-290.

  Stougie, L. (1993). A fast randomized algorithm for partitioning a graph into paths of fixed length. Discrete Applied Mathematics, 42(2-3), 291-303.

  Marchetti Spaccamela, A., Rhee, Wan Soo, Stougie, L. & Geer, S.A. van de (1992). Probabilistic analysis of the minimum weighted flowtime scheduling problem. Operations Research Letters, 11(2), 67-71.

  Stougie, L. & Rinnooy Kan, A.H.G. (1992). Probabilistic analysis of algorithms. Sankhya : the Indian Journal of Statistics, Series A, 54(special issue), 241-258.

  Geer, S.A. van de & Stougie, L. (1991). On rates of convergence and asymptotic normality in the multiknapsack problem. Mathematical Programming, 51(3), 349-358.

  Meanti, M., Rinnooy Kan, A.H.G., Stougie, L. & Vercellis, C. (1990). A probablistic analysis of the multiknapsack value function. Mathematical Programming, 46(2), 237-247.

  Rinnooy Kan, A.H.G. & Stougie, L. (1989). On the relation between complexity and uncertainty. Annals of Operations Research, 18(1-4), 17-23.

  Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G. & Stougie, L. (1985). Stochastic integer programming by dynamic programming. Statistica Neerlandica, 39(2), 97-113.

  Lenstra, J.K., Rinnooy Kan, A.H.G. & Stougie, L. (1984). A framework for the probabilistic analysis of hierarchical planning systems. Annals of Operations Research, 1(1), 23-42.

  Stougie, L., Frenk, J.B.G. & Rinnooy Kan, A.H.G. (1984). A hierarchical scheduling problem with a well-solvable second stage. Annals of Operations Research, 1(1), 43-58.

  Stougie, L., Marchetti Spaccamela, A. & Rinnooy Kan, A.H.G. (1984). Hierarchical vehicle routing problems. Networks, 14, 571-586.

  Boender, C.G.E., Rinnooy Kan, A.H.G., Timmer, G.T. & Stougie, L. (1982). A stochastic method for global optimization. Mathematical Programming, 22, 125-140.


Book - Monograph
  Stougie, L. (1987). Design and analysis of algorithms for stochastic integer programming (CWI Tracts, 37). Amsterdam: Centrum voor Wiskunde en Informatica.


Book chapter
  Sitters, R.A. & Stougie, L. (2008). The generalized two-server problem. In M.Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 351-352). New York NY: Springer.

  Aardal, K.I., Hoesel, S. van, Lenstra, J.K. & Stougie, L. (1997). A decade of combinatorial optimization. In W.K. Klein Haneveld, O.J. Vrieze & L.C.M. Kallenberg (Eds.), Ten years LNMB (CWI Tract, 122) (pp. 5-14). Amsterdam: CWI.

  Stougie, L. & Vlerk, M.H. van der (1997). Stochastic integer programming. In M. Dell'Amico, F. Maffioli & S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization (pp. 127-142). Chichester: Wiley.

  Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G. & Stougie, L. (1988). Stochastic integer programming by dynamic programming. In Yu. Ermoliev & R.J.B. Wets (Eds.), Numerical techniques for stochastic optimization (Springer Series in Computational Mathematics, 10) (pp. 403-412). New York: Springer.

  Rinnooy Kan, A.H.G. & Stougie, L. (1988). Stochastic integer programming. In Yu. Ermoliev & R.J.B. Wets (Eds.), Numerical techniques for stochastic optimization (Springer Series in Computational Mathematics, 10) (pp. 201-203). New York: Springer.

  Stougie, L., Haimovich, M. & Rinnooy Kan, A.H.G. (1988). Analysis of heuristics for vehicle routing problems. In B.L. Golden & A.A. Assad (Eds.), Vehicle routing : methods and studies (Studies in Management Science and Systems, 16) (pp. 47-61). Amsterdam: North-Holland.


Conference proceeding
  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2008). Minimizing average flow time in sensor data gathering. In S.P. Fekete (Ed.), Algorithmic Aspects of Wireless Sensor Networks (4th International Workshop, Algosensors 2008, Reykjavik, Iceland, July 12, 2008, Revised Selected Papers) Vol. 5389. Lecture Notes in Computer Science (pp. 18-29). Berlin: Springer.

  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2008). Minimizing flow time in the wireless gathering problem. In S. Albers & P. Weil (Eds.), Proceedings 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008, Bordeaux, France, February 21-23, 2008) Vol. 08001. Dagstuhl Seminar Proceedings (pp. 109-120). Schloss Dagstuhl: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI).

  Bonifaci, V., Stougie, L., Marchetti Spaccamela, A. & Korteweg, P. (2008). The distributed wireless gathering problem. In R. Fleischer & J. Xu (Eds.), Algorithmic Aspects in Information and Management (4th International Conference, AAIM'08, Shanghai, China, June 23-25, 2008, Proceedings) Vol. 5034. Lecture Notes in Computer Science (pp. 72-83). Berlin: Springer.

  Cottret, L., Vieira Milreu, P., Acuña, V., Marchetti Spaccamela, A., Viduani Martinez, F., Sagot, M.F. & Stougie, L. (2008). Enumerating precursor sets of target metabolites in a metabolic network. In K.A. Crandall & J. Lagergren (Eds.), Algorithms in Bioinformatics (Proceedings 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008) Vol. 5151. Lecture Notes in Computer Science (pp. 233-244). Berlin: Springer.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L., Hagen, F. & Boekhout, T. (2008). Constructing level-2 phylogenetic networks from triplets. In M. Vingron & L. Wong (Eds.), Research in Computational Molecular Biology (Proceedings 12th Annual International Conference, RECOMB 2008, Singapore, March 30-April 2, 2008) Vol. 4955. Lecture Notes in Computer Science (pp. 450-462). Berlin: Springer.

  Hurkens, C.A.J., Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L. & Tromp, J.T. (2007). Prefix reversals on binary and ternary strings. In H. Anai, K. Horimoto & T. Kutsia (Eds.), Proceedings of the Second International Conference on Algebraic Biology (AB 2007) 2-4 July 2007, Castle of Hagenberg, Austria Vol. 4545. Lecture Notes in Computer Science (pp. 292-306). Berlin, Germany: Springer.

  Korteweg, P., Marchetti Spaccamela, A., Stougie, L. & Vitaletti, A. (2007). Data aggregation in sensor networks : balancing communication and delay costs. In G. Precipe & S. Zaks (Eds.), Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2007) 5-8 June 2007, Castiglioncello, Italy Vol. 4474. Lecture Notes in Computer Science (pp. 139-150). Berlin: Springer.

  Becchetti, L., Korteweg, P., Marchetti Spaccamela, A., Skutella, M., Stougie, L. & Vitaletti, A. (2006). Latency constrained aggregation in sensor networks. In Y. Azar & T. Erlebach (Eds.), Algorithms - ESA 2006 (Proceedings 14th Annual European Symposium, Zürich, Switzerland, September 11-13, 2006) Vol. 4168. Lecture Notes in Computer Science (pp. 88-99). Berlin: Springer.

  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2006). An approximation algorithm for the Wireless Gathering Problem. In L. Arge & R. Freivalds (Eds.), Algorithm Theory - SWAT 2006 (Proceedings 10th Scandinavian Workshop, Riga, Latvia, July 6-8, 2006) Vol. 4059. Lecture Notes in Computer Science (pp. 328-338). Berlin: Springer.

  Bonifaci, V. & Stougie, L. (2007). Online k-server routing problems. In T. Erlebach, T. Erlebach, C. Kaklamanis & C. Kaklamanis (Eds.), Proceedings of the 4th International Workshop on Approximation and Online Algorithms (WAOA 2006) 14-15 September 2006, Zürich, Switzerland Vol. 4368. Lecture Notes in Computer Science (pp. 83-94). Berlin: Springer.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M. & Stougie, L. (2006). Beaches of islands of tractability : algorithms for parsimony and minimum perfect phylogeny haplotyping problems. In P. Bücher & B.M.E. Moret (Eds.), Algorithms in Bioinformatics (Proceedings 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006) Vol. 4175. Lecture Notes in Computer Science (pp. 80-91). Berlin: Springer.

  Krumke, S.O., Paepe, W.E. de, Poensgen, D., Lipmann, M., Marchetti Spaccamela, A. & Stougie, L. (2006). On minimizing the maximum flow time in the online dial-a-ride problem. In T. Erlebach & G. Persinao (Eds.), Approximation and Online Algorithms (3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised selected papers) Vol. 3879. Lecture Notes in Computer Science (pp. 258-269). Berlin: Springer.

  Hurkens, C.A.J., Keijsper, J.C.M. & Stougie, L. (2005). Virtual private network design : a proof of the tree routing conjecture on ring networks. In M. Jünger & V. Kaibel (Eds.), Integer Programming and Combinatorial Optimization (Proceedings 11th International Conference, IPCO 2005, Berlin, Germany, June 8-10, 2005) Vol. 3509. Lecture Notes in Computer Science (pp. 407-421). Berlin: Springer-Verlag.

  Stougie, L. (2004). Polynomial solvability of Mader's edge-disjoint paths problem (Abstract). In Proceedings Workshop on Graphs and Combinatorial Optimization (CTW04, Como, Italy, May 31-June 2, 2004) Vol. 17. Electronic Notes in Discrete Mathematics (pp. 7).

  Cryan, M., Dyer, M., Müller, H. & Stougie, L. (2003). Random walks on the vertices of transportation polytopes with constant number of sources. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA, Baltimore MA, USA, January 12-14, 2003) (pp. 330-339). Philadelphia: SIAM.

  Sitters, R.A., Stougie, L. & Paepe, W.E. de (2003). A competitive algorithm for the general 2-server problem. In J.C.M. Baeten, J.K. Lenstra, J. Parrow & G.J. Woeginger (Eds.), Automata, Languages and Programming (Proceedings 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30-July 4, 2003) Vol. 2719. Lecture Notes in Computer Science (pp. 624-636). Berlin: Springer-Verlag.

  Bontridder, K.M.J. de, Lageweg, B.J., Lenstra, J.K., Orlin, J.B. & Stougie, L. (2002). Branch-and-bound algorithms for the test cover problem. In R. Möhring & R. Raman (Eds.), Algorithms - ESA 2002 (Proceedings 10th Annual European Symposium, Rome, Italy, September 17-21, 2002) Vol. 2461. Lecture Notes in Computer Science (pp. 223-233). Berlin: Springer-Verlag.

  Krumke, S.O., Lipmann, M., Paepe, W.E. de, Poensgen, D., Rambau, J., Stougie, L. & Woeginger, G.J. (2002). How to cut a cake almost fairly. In Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) (pp. 263-264). Philadelphia: SIAM.

  Krumke, S.O., Laura, L., Lipmann, M., Marchetti Spaccamela, A., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2002). Non-abusiveness helps: An $\mathcal O(1)$-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem. In K. Jansen, S. Leonardi & V. Vazirani (Eds.), Approximation Algorithms for Combinatorial Optimization (Proceedings APPROX 2002, Rome Italy, September 17-21, 2002) Vol. 2462. Lecture Notes in Computer Science (pp. 200-214). Berlin: Springer-Verlag.

  Lipmann, M., Lu, X., Paepe, W.E. de, Sitters, R.A. & Stougie, L. (2002). On-line dial-a-ride problems under a restricted information model. In R. Möhring & R. Raman (Eds.), Algorithms - ESA 2002 (Proceedings of the 10th Annual European Symposium, Rome, Italy, September 17-21, 2002) Vol. 2461. Lecture Notes in Computer Science (pp. 674-685). Berlin: Springer-Verlag.

  Krumke, S.O., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2001). News from the online traveling repairman. In J. Sgall, A. Pultr & P. Kolman (Eds.), Mathematical Foundations of Computer Science 2001 (Proceedings 26th International Symposium, MFCS 2001, Marianske Lazne, Czech Republic, August 27-31, 2001) Vol. 2136. Lecture Notes in Computer Science (pp. 487-499). Berlin: Springer Verlag.

  Krumke, S.O., Paepe, W.E. de, Stougie, L. & Rambau, J. (2001). Online bin coloring. In F. Meyer auf der Heide (Ed.), Algorithms - ESA2001 (Proceedings 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001) Vol. 2161. Lecture Notes in Computer Science (pp. 74-85). Berlin: Springer Verlag.

  Blom, M., Krumke, S.O., Paepe, W.E. de & Stougie, L. (2000). The online-TSP against fair adversaries. In G.C. Bongiovanni, G. Gambosi & R. Petreschi (Eds.), Algorithms and Complexity (Proceedings 4th Italian Conference, CIAC 2000, Rome, Italy, March 1-3, 2000) Vol. 1767. Lecture Notes in Computer Science (pp. 137-149). Berlin: Springer-Verlag.

  Bartal, Y., Leonardi, S., Marchetti Spaccamela, A., Sgall, J. & Stougie, L. (1996). Multiprocessor scheduling with rejection. In Proceedings of the Seventh Annual ACM-SIAM Symposium in Discrete Algorithms (SODA'96, Atlanta GA, USA, January 28-30, 1996). SIAM.

  Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L. & Talamo, M. (1995). Competitive algorithms for the on-line traveling salesman. In S.G. Akl, F. Dehne, J.R. Sack & N. Santoro (Eds.), Algorithms and Data Structures (Proceedings 4th International Workshop, WADS '95, Kingston, Canada, August 16-18, 1995) Vol. 955. Lecture Notes in Computer Science (pp. 206-217). Berlin: Springer-Verlag.

  Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L. & Talamo, M. (1994). Serving requests with on-line routing. In E. Meineche Schmidt & S. Skyum (Eds.), Algorithm Theory - SWAT '94 (Proceedings of the 4th Scandinavian Workshop, Aarhus, Denmark, July 6-8, 1994) Vol. 824. Lecture Notes in Computer Science (pp. 37-48). Berlin: Springer-Verlag.

  Stougie, L. (1992). Stochatsic integer programming (Abstract). In W. Gaul, A. Bachem, W. Habenicht, W. Runge & W.W. Stahl (Eds.), Operations Research Proceedings 1991 (Papers of the 20th Annual Meeting of DGOR, Universität Hohenheim, Stuttgart, Germany, September 4-6, 1991) (pp. 389). Berlin: Springer-Verlag.

  Stougie, L. (1988). The stochastic knapsack problem (Abstract). In H. Schellhaas, P. van Beek, H. Isermann, R. Schmidt & M. Zijlstra (Eds.), Operations Research Proceedings 1987 (Papers of the 16th Annual Meeting of DGOR, in cooperation with NSOR, Veldhoven, The Netherlands, September 23-25, 1987) (pp. 626-627). Amsterdam: Springer-Verlag.

  Boender, C.G.E., Rinnooy Kan, A.H.G., Stougie, L. & Timmer, G.T. (1980). Global optimization : a stochastic approach. In F. Archetti & M. Cugiani (Eds.), Numerical techniques for stochastic systems (Conf. Gargnano, Italy, September 1979) (pp. 387-394). North-Holland.


Book review
  Stougie, L. (1999). [Book review Stochastic Decomposition]. Eur. J. Oper. Res., 112(1), 245-247.


report
  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2008). Minimizing flow time in the wireless gathering problem. SPOR Report (Ext. rep. 2008-01). Eindhoven: Technische Universiteit Eindhoven.

  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2008). The distributed wireless gathering problem. SPOR Report (Ext. rep. 2008-02). Eindhoven: Technische Universiteit Eindhoven.

  Cardon, S., Dommers, S., Eksin, C., Sitters, R.A., Stougie, A. & Stougie, L. (2008). A PTAS for the multiple depot vehicle routing problem. SPOR Report (Ext. rep. 2008-03). Eindhoven: Technische Universiteit Eindhoven.

  Chierichetti, F., Lacroix, V., Marchetti Spaccamela, A., Sagot, M.F. & Stougie, L. (2007). Modes and cuts in metabolic networks : complexity and algorithms. SPOR Report (Ext. rep. 2007-01). Eindhoven: Technische Universiteit Eindhoven.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M. & Stougie, L. (2007). Constructing level-2 phylogenetic networks from triplets. arXiv.org [q-bio.PE] (Ext. rep. 0707.2890). -: -.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M. & Stougie, L. (2007). Shorelines of islands of tractability : algorithms for parsimony and minimum perfect phylogeny haplotyping problems. SPOR Report (Ext. rep. 2007-03). Eindhoven: Technische Universiteit Eindhoven.

  Korteweg, P., Marchetti Spaccamela, A., Stougie, L. & Vitaletti, A. (2007). Data aggregation in sensor networks : balancing communication and delay costs. SPOR Report (Ext. rep. 2007-02). Eindhoven: Technische Universiteit Eindhoven.

  Krumke, S.O., Paepe, W.E. de, Rambau, J. & Stougie, L. (2007). Bincoloring. SPOR Report (Ext. rep. 2007-04). Eindhoven: Technische Universiteit Eindhoven.

  Becchetti, L., Korteweg, P., Marchetti Spaccamela, A., Skutella, M., Stougie, L. & Vitaletti, A. (2006). Latency constrained aggregation in sensor networks. SPOR Report (Ext. rep. 2006-08). Eindhoven: Technische Universiteit Eindhoven.

  Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A. & Stougie, L. (2006). An approximation algorithm for the Wireless Gathering Problem. SPOR Report (Ext. rep. 2006-02). Eindhoven: Technische Universiteit Eindhoven.

  Bonifaci, V., Lipmann, M. & Stougie, L. (2006). Online multi-server dial-a-ride problems. SPOR Report (Ext. rep. 2006-04). Eindhoven: Technische Universiteit Eindhoven.

  Cryan, M., Dyer, M., Müller, H. & Stougie, L. (2006). Random walks on the vertices of transportation polytopes with constant number of sources. SPOR Report (Ext. rep. 2006-07). Eindhoven: Technische Universiteit Eindhoven.

  Hurkens, C.A.J., Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M., Stougie, L. & Tromp, J.T. (2006). Prefix reversals on binary and ternary strings. SPOR Report (Ext. rep. 2006-10). Eindhoven: Technische Universiteit Eindhoven.

  Iersel, L.J.J. van, Keijsper, J.C.M., Kelk, S.M. & Stougie, L. (2006). Beaches of islands of tractability : algorithms for parsimony and minimum perfect phylogenyhaplotyping problems. SPOR Report (Ext. rep. 2006-09). Eindhoven: Technische Universiteit Eindhoven.

  Schütz, P., Stougie, L. & Tomasgard, A. (2006). Stochastic facility location with general long-run costs and convex short-run costs. SPOR Report (Ext. rep. 2006-03). Eindhoven: Technische Universiteit Eindhoven.

  Broek, J.J.J. van den, Schütz, P., Stougie, L. & Tomasgard, A. (2005). Location of slaughterhouses under economies of scale. SPOR Report (Ext. rep. 2005-12). Eindhoven: Technische Universiteit Eindhoven.

  Klein Haneveld, W.K., Stougie, L. & Vlerk, M.H. van der (2005). Simple integer resource models : convexity and convex approximations. SPOR Report (Ext. rep. 2005-16). Eindhoven: Technische Universiteit Eindhoven.

  Krumke, S.O., Lipmann, M., Marchetti Spaccamela, A., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2005). On minimizing the maximum flow time in the online dial-a-ride problem. SPOR Report (Ext. rep. 2005-17). Eindhoven: Technische Universiteit Eindhoven.

  Sitters, R.A. & Stougie, L. (2005). The generalized two-server problem. SPOR Report (Ext. rep. 2005-15). Eindhoven: Technische Universiteit Eindhoven.

  Stougie, L. & Vlerk, M.H. van der (2005). Approximation in stochastic integer programming. SPOR Report (Ext. rep. 2005-10). Eindhoven: Technische Universiteit Eindhoven.

  Stougie, L. & Dyer, M. (2005). Computational complexity of stochastic programming problems. SPOR Report (Ext. rep. 2005-11). Eindhoven: Technische Universiteit Eindhoven.

  Hurkens, C.A.J., Keijsper, J.C.M. & Stougie, L. (2004). Virtual private network design : a proof of the tree routing conjecture on ring networks. SPOR Report (Ext. rep. 2004-15). Eindhoven: Technische Universiteit Eindhoven.

  Brightwell, G., Heuvel, J. van den & Stougie, L. (2003). A linear bound on the diameter of the transportation polytope. SPOR Report (Ext. rep. 2003-12). Eindhoven: Technische Universiteit Eindhoven.

  Dye, S., Stougie, L. & Tomasgard, A. (2003). The stochastic single resource service-provision problem. SPOR Report (Ext. rep. 2003-13). Eindhoven: Technische Universiteit Eindhoven.

  Dyer, M. & Stougie, L. (2003). Computational complexity of stochastic programming problems. SPOR Report (Ext. rep. 2003-20). Eindhoven: Technische Universiteit Eindhoven.

  Keijsper, J.C.M., Pendavingh, R.A. & Stougie, L. (2003). A linear programming formulation of Mader's edge-disjoint paths problem. SPOR Report (Ext. rep. 2003-15). Eindhoven: Technische Universiteit Eindhoven.

  Krumke, S.O., Laura, L., Lipmann, M., Marchetti Spaccamela, A., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2003). Minimizing the maximum flow time in the online TSP on the real line. SPOR Report (Ext. rep. 2003-01). Eindhoven: Technische Universiteit Eindhoven.

  Paepe, W.E. de, Lenstra, J.K., Sgall, J., Sitters, R.A. & Stougie, L. (2003). Computer-aided complexity classification of dial-a-ride problems. SPOR Report (Ext. rep. 2003-07). Eindhoven: Technische Universiteit Eindhoven.

  Sitters, R.A., Stougie, L. & Paepe, W.E. de (2003). A competitive algorithm for the general 2-server problem. SPOR Report (Ext. rep. 2003-04). Eindhoven: Technische Universiteit Eindhoven.

  Sitters, R.A. & Stougie, L. (2003). The general two-server problem. SPOR Report (Ext. rep. 2003-23). Eindhoven: Technische Universiteit Eindhoven.

  Stougie, L. & Vlerk, M.H. van der (2003). Approximation in stochastic integer programming. SPOR Report (Ext. rep. 2003-14). Eindhoven: Technische Universiteit Eindhoven.

  Bontridder, K.M.J. de, Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R. & Stougie, L. (2002). Approximation algorithms for the test cover problem. SPOR Report (Ext. rep. 2002-10). Eindhoven: Technische Universiteit Eindhoven.

  Cryan, M., Dyer, M., Müller, H. & Stougie, L. (2002). Random walks on the vertices of transportation polytopes with constant number of sources. SPOR Report (Ext. rep. 2002-14). Eindhoven: Technische Universiteit Eindhoven.

  Dyer, M., Kannan, R. & Stougie, L. (2002). A simple randomised algorithm for convex optimization : application to two-stage stochastic programming. SPOR Report (Ext. rep. 2002-05). Eindhoven: Technische Universiteit Eindhoven.

  Heuvel, J. van den & Stougie, L. (2002). A quadratic bound on the diameter of the transportation polytope. SPOR Report (Ext. rep. 2002-17). Eindhoven: Technische Universiteit Eindhoven.

  Krumke, S.O., Paepe, W.E. de, Poensgen, D. & Stougie, L. (2002). News from the online traveling repairman. SPOR Report (Ext. rep. 2002-02). Eindhoven: Technische Universiteit Eindhoven.

  Lipmann, M., Lu, X., Paepe, W.E. de, Sitters, R.A. & Stougie, L. (2002). On-line dial-a-ride problems under a restricted information model. SPOR Report (Ext. rep. 2002-07). Eindhoven: Technische Universiteit Eindhoven.

  Lu, X., Sitters, R.A. & Stougie, L. (2002). A class of on-line scheduling algorithms to minimize total completion time. SPOR Report (Ext. rep. 2002-11). Eindhoven: Technische Universiteit Eindhoven.

  Stougie, L. (2002). A polynomial bound on the diameter of the transportation polytope. SPOR Report (Ext. rep. 2002-15). Eindhoven: Technische Universiteit Eindhoven.

  Stougie, L. & Vestjens, A.P.A. (2000). Randomized algorithms for on-line scheduling problems : how low can't you go? SPOR Report (Ext. rep. 2000-13). Eindhoven: Technische Universiteit Eindhoven.

  Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L. & Talamo, M. (1999). Algorithms for the on-line travelling salesman. Memorandum COSOR (Ext. rep. 99-09). Eindhoven: Technische Universiteit Eindhoven.

  Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L. & Talamo, M. (1999). Algorithms for the on-line travelling salesman problem. Memorandum COSOR (Ext. rep. 99-09). Eindhoven: Technische Universiteit Eindhoven.

  Bartal, Y., Leonardi, S., Marchetti Spaccamela, A., Sgall, J. & Stougie, L. (1999). Multiprocessor scheduling with rejection. Memorandum COSOR (Ext. rep. 99-06). Eindhoven: Technische Universiteit Eindhoven.

  Blom, M., Krumke, S.O., Paepe, W.E. de & Stougie, L. (1999). The online-TSP against fair adversaries. Memorandum COSOR (Ext. rep. 99-23). Eindhoven: Technische Universiteit Eindhoven.

  Dye, S., Stougie, L. & Tomasgard, A. (1999). Single node service provision problem with fixed charges. Memorandum COSOR (Ext. rep. 99-04). Eindhoven: Technische Universiteit Eindhoven.

  Dye, S., Stougie, L. & Tomasgard, A. (1999). Single node service provision with fixed charges. Memorandum COSOR (Ext. rep. 99-04). Eindhoven: Technische Universiteit Eindhoven.

  Dye, S., Stougie, L. & Tomasgard, A. (1999). The stochastic single node service provision problem. Memorandum COSOR (Ext. rep. 99-13). Eindhoven: Technische Universiteit Eindhoven.

  Feuerstein, E., Mydlarz, M. & Stougie, L. (1999). On-line multi-threaded scheduling. Memorandum COSOR (Ext. rep. 99-21). Eindhoven: Technische Universiteit Eindhoven.

  Feuerstein, E., Mydlarz, M. & Stougie, L. (1999). On-line multi-threaded scheduling. Memorandum COSOR (Ext. rep. 99-21). Eindhoven: Technische Universiteit Eindhoven.

  Dye, S., Stougie, L. & Tomasgard, A. (1998). Approximation algorithms and relaxations for a service provision problem on a telecommunication network. Memorandum COSOR (Ext. rep. 98-04). Eindhoven: Technische Universiteit Eindhoven.

  Feuerstein, E. & Stougie, L. (1998). On-line single server dial-a-ride problems. Memorandum COSOR (Ext. rep. 98-24). Eindhoven: Technische Universiteit Eindhoven.

  Aardal, K.I., Hoesel, S. van, Lenstra, J.K. & Stougie, L. (1997). A decade of combinatorial optimization. Memorandum COSOR (Ext. rep. 97-09). Eindhoven: Technische Universiteit Eindhoven.

  Desrochers, M., Jones, C.V., Lenstra, J.K., Savelsbergh, M.W.P. & Stougie, L. (1997). Towards a model and algorithm management system for vehicle routing and scheduling problems. Memorandum COSOR (Ext. rep. 97-10). Eindhoven: Technische Universiteit Eindhoven.

  Desrochers, M., Jones, C.V., Lenstra, J.K., Savelsbergh, M.W.P. & Stougie, L. (1997). Towards a model and algorithm management system for vehicle routing and scheduling problems. A&E-report. Amsterdam: Universiteit van Amsterdam.

  Klein Haneveld, W.K., Vlerk, M.H. van der & Stougie, L. (1997). Convex approximations for simple integer recourse models by perturbing the underlying distributions. A&E-Report. Amsterdam: Universiteit van Amsterdam.

  Klein Haneveld, W.K., Stougie, L. & Vlerk, M.H. van der (1997). Convex simple integer recourse models. A&E-Report. Amsterdam: Universiteit van Amsterdam.

  Stougie, L., Tomasgard, A., Audestad, J.A., Dye, S., Vlerk, M.H. van der & Wallace, S.W. (1997). Modelling in distributed telecommunications networks. Amsterdam-Rotterdam: Tinbergen Institute.

  Geer, S.A. van de & Stougie, L. (1989). On rates of convergence and asymptotic normality in the multiknapsack problem. CWI Report (Ext. rep. BS-R8912). Amsterdam: CWI.

  Marchetti Spaccamela, A., Rhee, Wan Soo, Stougie, L. & Geer, S.A. van de (1989). Probabilistic analysis of the minimum weighted flowtime scheduling problem. CWI Report (Ext. rep. BS-R8913). Amsterdam: CWI.

  Geer, S.A. van de & Stougie, L. (1988). On a rate of convergence of the multiknapsack value function. CWI Report (Ext. rep. MS-R8812). Amsterdam: CWI.

  Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G. & Stougie, L. (1985). Stochastic integer programming by dynamic programming. CWI Report (Ext. rep. OS-R8503). Amsterdam: CWI.