|
Click on a project in the table below for all publications registered to that project.
Project IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
2009
- J.J.J.van den Broek, C.A.J. Hurkens and G.Woeginger. Timetabling problems at the TU Eindhoven. In European Journal of Operational Research, vol. 196 (3), 877 - 885, 2009.
- Korteweg, P., Marchetti Spaccamela, A., Stougie, L., Vitaletti, A. (2009). Data aggregation in sensor networks : balancing communication and delay costs. {\em Theoretical Computer Science 410}, 2009, 1346--1354.
- Schrijver, A.: Graph invariants in the spin model Journal of combinatorial theory - Series B, Vol. 99, 2009, pp. 502 - 511, ISSN: 0095-8956. Academic Press, 2009
- Lovász, L. - Schrijver, A.: Semidefinite functions on categories Electronic Journal of Combinatorics, Vol. 16, 2009, pp. 0 - 14, ISSN: 1077-8926. [s.n.], 2009
- Huisman, D. - Kroon, L.G. - Abbink, E. - Fioole, P.J. - Fischetti, M. - Maroti, G. - Schrijver, A. - Steenbeek, A.G.: The new Dutch timetable: The OR revolution Interfaces, Vol. 39, 2009, pp. 6 - 17, ISSN: 0092-2102, e-ISSN: 1526-551X. INFORMS, 2009
- Lovász, L. - Schrijver, A.: Dual graph homomorphism functions Journal of Combinatorial Theory, Series A, Vol. 117, 2010, pp. 216 - 222, ISSN: ???. Elsevier, 2010
- G. Diepen, B.F.I. Pieters, J.M. van den Akker, and J.A. Hoogeveen (2009). Robust planning of Airport Platform Buses Technical report UU-CS-2009-26.
- G. Diepen, J. M. van den Akker, and J. A. Hoogeveen (2009). Integrated gate and bus assignment at Amsterdam Airport Schiphol. In Robust and Online Large-Scale Optimization , pages 338-353, 2009.
- Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx: Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60
- Hans L. Bodlaender: Kernelization: New Upper and Lower Bound Techniques. IWPEC 2009: 17-37
- Vermeulen, I.B. - Bohté, S.M. - Bosman, P.A.N. - Elkhuizen, S.G. - Bakker, P.J.M. - La Poutré, J.A.: Optimization of Online Patient Scheduling with Urgencies and Preferences In: Artificial Intelligence in Medicine, Series: Lecture notes in artificial intelligence, Vol. 5651, July 2009, pp. 71 - 80, ISSN: 0302-9743, e-ISSN: 1611-3349, conference title: Conference on Artificial Intelligence in Medicine, (AIME), Number 12, Date: 2009, July 20 - July 22, Verona, Italy. Springer, 2009
- Bosman, P.A.N.: On Empirical Memory Design, Faster Selection of Bayesian Factorizations and Parameter-Free Gaussian EDAs In: Proceedings of ACM Annual Genetic and Evolutionary Computation Conference 2009, first edition, 2009, pp. 389 - 396, ISBN: 978-1-60558-325, conference title: ACM Annual Genetic and Evolutionary Computation Conference , (GECCO), Date: 2009, July 8 - July 12, Montreal, Canada. Editors: Raidl, G.. ACM Press, 2009
- Hutzschenreuter, A.K. - Bosman, P.A.N. - La Poutré, J.A.: Evolutionary Multiobjective Optimization for Dynamic Hospital Resource Management In: Proceedings of Evolutionary Multi-Criterion Optimization 2009, Series: Springer series Lecture Notes in Computer Science, Vol. 5467 , 2009, pp. 320 - 334, ISBN: 978-3-642-01019, conference title: Evolutionary Multi-Criterion Optimization, (EMO), Date: 2009. Editors: Sevaux, M. and Fonseca, C.M. and Gandibleux, X. and Hao, J.-K. and Ehrgott, M.. Springer , 2009
- Bosman, P.A.N. - Grahl, J. - Thierens, D.: AMaLGaM IDEAs in Noisy Black-Box Optimization Benchmarking In: Proceedings of ACM Annual Genetic and Evolutionary Computation Conference 2009, first edition, 2009, pp. 2351 - 2358, ISBN: 978-1-60558-325, conference title: ACM Annual Genetic and Evolutionary Computation Conference , (GECCO), Date: 2009, July 8 - July 12, Montreal, Canada. Editors: Whitley, D. and Ros, R. and Schoenauer, M. and Finck, S. and Hansen, N. and Beyer, H.-G. and Auger, A.. ACM Press, 2009
- Bosman, P.A.N. - Grahl, J. - Thierens, D.: AMaLGaM IDEAs in Noiseless Black-Box Optimization Benchmarking In: Proceedings of ACM Annual Genetic and Evolutionary Computation Conference 2009, first edition, 2009, pp. 2247 - 2254, ISBN: 978-1-60558-325, conference title: ACM Annual Genetic and Evolutionary Computation Conference , (GECCO), Date: 2009, July 8 - July 12, Montreal, Canada. Editors: Auger, A. and Beyer, H.-G. and Hansen, N. and Finck, S. and Ros, R. and Schoenauer, M. and Whitley, D.. ACM Press, 2009
- Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009:44-53
- Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. (TCS) 410(14):1319-1327 (2009)
- Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms (JDA) 7(2):147 (2009)
- Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully Decomposable Split Graphs. IWOCA 2009:105-112
- Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring -Free Graphs. IWOCA 2009:95-104
- Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma: Complexity of conditional colorability of graphs. Appl. Math. Lett. (APPML) 22(3):320-324 (2009)
- Johann Hurink, Jacob Jan Paulus: Online scheduling of parallel jobs on two machines is 2-competitive. Oper. Res. Lett. (ORL) 36(1):51-56 (2008)
- T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, J. M. J. Schutten: Time-constrained project scheduling. J. Scheduling (SCHEDULING) 11(2):137-148 (2008)
- Johann Hurink, Tim Nieberg: Approximating minimum independent dominating sets in wireless networks. Inf. Process. Lett. (IPL) 109(2):155-160 (2008)
- Raluca Marin-Perianu, Johann Hurink, Pieter H. Hartel: A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks. ISPA 2008:863-870
- Philip K. F. Hölzenspies, Johann Hurink, Jan Kuper, Gerard J. M. Smit: Run-time Spatial Mapping of Streaming Applications to a Heterogeneous Multi-Processor System-on-Chip (MPSOC). DATE 2008:212-217
- Johann Hurink, Jacob Jan Paulus: Special Cases of Online Parallel Job Scheduling. CTW 2008:82-85
- Tim Nieberg, Johann Hurink, Walter Kern: Approximation schemes for wireless networks. ACM Transactions on Algorithms (TALG) 4(4) (2008)
- Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti: Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. (ORL) 37(4):261-264 (2009)
- Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger: The hardness of train rearrangements. Oper. Res. Lett. (ORL) 37(2):80-82 (2009)
- Walter Kern, Daniël Paulusma: On the Core and -Nucleolus of Flow Games. Math. Oper. Res. (MOR) 34(4):981-991 (2009)
- Monique Laurent: Matrix Completion Problems. Encyclopedia of Optimization 2009:1967-1975
- Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin: Block-diagonal semidefinite programming hierarchies for 0/1 programming. Oper. Res. Lett. (ORL) 37(1):27-31 (2009)
- Jean B. Lasserre, Monique Laurent, Philipp Rostalski: A prolongation-projection algorithm for computing the finite real variety of an ideal. Theor. Comput. Sci. (TCS) 410(27-29):2685-2700 (2009)
- Jirí Fiala, Marcin Kaminski, Bernard Lidický, Daniël Paulusma: The k-in-a-path problem for claw-free graphs CoRR abs/0912.5468 (2009)
- Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos: Induced Packing of Odd Cycles in a Planar Graph. ISAAC 2009:514-523
- Vincenzo Bonifaci, Leen Stougie: Online -Server Routing Problems. Theory Comput. Syst. (MST) 45(3):470-485 (2009)
- Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger: Combinatorial Optimization Problems with Conflict Graphs. CTW 2009:293-296
- Gerhard J. Woeginger: A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. Inf. Process. Lett. (IPL) 109(7):341-342 (2009)
- Jacob Jan Paulus, Deshi Ye, Guochuan Zhang: Optimal online-list batch scheduling. Inf. Process. Lett. (IPL) 109(19):1125-1128 (2009)
2008
- Erlebach, T., van Leeuwen, E.J., "Approximating Geometric Coverage Problems" in SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2008, pp. 1267-1276.
- Erlebach, T., van Leeuwen, E.J., "Domination in Geometric Intersection Graphs" in Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L.(eds.) Theoretical Informatics - LATIN 2008, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, LNCS 4957, Springer-Verlag, Berlin, 2008, pp. 747-758.
- H.L. Bodlaender, R.B. Tan, Th.C. van Dijk, and J. van Leeuwen. "Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint", in: J. Gudmundsson (Ed.), Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Proceedings, Lecture Notes in Computer Science, Vol. 5124, Springer-Verlag, Berlin, 2008, pp. 102-113.
- J. van Leeuwen, J. Wiedermann. "How We Think of Computing Today", in: A. Beckmann, C. Dimitracopoulos, and B. L\"owe (Eds.), Logic and Theory of Algorithms, 4th Conference on Computability in Europe (CiE 2008), Proceedings, Lecture Notes in Computer Science, Vol. 5028, Springer-Verlag, Berlin, 2008, pp. 579-593.
- G. Diepen, J.M. van den Akker, J.A. Hoogeveen. "Integrated gate and bus assignment at Amsterdam Airport Schiphol". In: M. Fischetti and P. Widmayer (Eds.), ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Selected Papers, Published by Schloss Dagstuhl - LZI, Germany, 2008.
- G. Diepen. "Column Generation Algorithms for Machine Scheduling and Integrated Airport Planning", Ph.D. Thesis, Dept of Information and Computing Sciences, Utrecht University, 2008.
- Bonifaci, V., Korteweg, P., Marchetti Spaccamela, A., Stougie, L. An approximation algorithm for the Wireless Gathering Problem. {\em Operations Research Letters, 36(5)}, 2008, 605-608.
- Cryan, M., Dyer, M., Müller, H., Stougie, L. Random walks on the vertices of transportation polytopes with constant number of sources. {\em Random Structures and Algorithms, 33(3)}, 2008, 333-355.
- Krumke, S.O., Paepe, W.E. de, Rambau, J., Stougie, L. Bincoloring. {\em Theoretical Computer Science, 407(1-3)}, 2008, 231-241.
- Schütz, P., Stougie, L., Tomasgard, A. Stochastic facility location with general long-run costs and convex short-run costs. {\em Computers and Operations Research, 35(9)}, 2008, 2988-3000.
- V. Bonifaci, P. Korteweg, A. Marchetti Spaccamela, L. Stougie. Minimizing flow time in the wireless gathering problem. In S. Albers, P. Weil, C. Rochange (Eds.), Proceedings 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2008, Bordeaux, France, February 21--23, 2008). (Dagstuhl Seminar Proceedings, Vol. 08001, 2008, pp. 109--120). Schloss Dagstuhl: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI).
- V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, L. Stougie, The Distributed Wireless Gathering Problem, In Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM), Shanghai, China, June 23--25, 2008, {\em Lecture Notes in Computer Science}, {\bf 5034}, Springer, Berlin, 2008, pp. 73--82
- V. Bonifaci, P. Korteweg, A. Marchetti-Spaccamela, L. Stougie, Minimizing average flow time in sensor data gathering, In Proceedings of the 4th International Conference on Algorithms for Sensor Networks (Algosensor), Reykjavik, Iceland, July 2008, {\em Lecture Notes in Computer Science}, {\bf 5389}, Springer, Berlin, 2008, pp. 18--29.
- S. Cardon, S. Dommers, C. Eksin, R.Sitters, A. Stougie, L. Stougie, A PTAS for the Multiple Depot Vehicle Routing Problem, SPOR-Report 2008-03, Technische Universiteit Eindhoven, 2008. http://www.win.tue.nl/math/bs/spor/2008-03.pdf
- P.A.N. Bosman, J. Grahl and D. Thierens. Enhancing the Performance of Maximum-Likelihood Gaussian EDAs Using Anticipated Mean Shift. In G. Rudolph and others, editors, Parallel Problem Solving from Nature - PPSN X, pages 133-143, Springer-Verlag, Berlin, 2008.
- P.A.N. Bosman and J.A. La Poutré. Online Transportation and Logistics using Computationally Intelligent Anticipation. In A. Fink, A. and F. Rothlauf (eds) Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management, Series: Studies in computational intelligence, Vol. 144, pp. 185 - 208, 2008.
- P.A.N. Bosman and J. Grahl. Matching Inductive Search Bias and Problem Structure in Continuous Estimation-of-Distribution Algorithms. In European journal of operational research, Vol. 185, Nr. 3, pp. 1246 - 1264, 2008.
- A.E. Brouwer, G.F. Post and G.J. Woeginger. Tight bounds for break minimization in tournament scheduling. Journal of Combinatorial Theory, Series A, 115 (6). pp. 1065-1068, 2008.
- T. Brueggemann, J.L. Hurink, T. Vredeveld and G.J. Woeginger. Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, pp. 41-54. Lecture Notes in Computer Science 4927, 2008.
- T.A. Guldemond, J.L. Hurink, J.J. Paulus and J.M.J. Schutten. Time-Constrained Project Scheduling. Journal of Scheduling, 11(2):137-148, 2008.
- J.L. Hurink and J.J. Paulus. Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive. Operations Research Letters, 36(1):51-56, 2008.
- J.L. Hurink and J.J. Paulus. Online algorithms for parallel job scheduling and strip packing. In 5th International Workshop on Approximation and Online Algorithms (WAOA 2007), Lecture Notes in Computer Science 4927, pp. 67-74, 2008.
- J.L. Hurink, A.L. Kok, J.J. Paulus and J.M.J. Schutten. Time-constrained project scheduling with adjacent resources. Technical Report Beta working paper WP-261, TUe, ISSN: 1386-9213, November 2008.
- J.J. Paulus, D. Ye and G. Zhang. Optimal Online-list Batch Scheduling. Technical Report Beta working paper WP-260, TUe, ISSN: 1386-9213, November 2008.
- Nieberg, Tim; Hurink, Johann; Kern, Walter Approximation schemes for wireless networks. ACM Trans. Algorithms 4 (2008), no. 4, Art. 49, 17 pp.
2007
- Hurkens, C.A.J., Keijsper, J.C.M., Stougie, L. Virtual private network design : a proof of the tree routing conjecture on ring networks. {\em SIAM Journal on Discrete Mathematics}, {\bf 21}, 2007, 482-503.
- J.M.H. Vissers, I.J.B.F. Adan, and N.P. Dellaert. Developing a platform for comparison of hospital admission systems: An Illustration. European Journal of Operational Research 180 (2007) 1290-1301.
- M.B. Duinkerken; R. Dekker; S.T.G.L. Kurstjens; J.A. Ottjes and N.P. Dellaert. Comparing transportation systems for inter-terminal transport at the Maasvlakte Containter Terminals, in: K.H. Kim and H.O. Günther (eds.), Container Terminals and Cargo Systems, Springer-Verlag, 2007, pp. 15-36
- S. Dabia; G.P. Kiesmüller, N.P. Dellaert. A stochastic inventory policy with limited transportation capacity, BETA research school, WIP 219, 2007, 21 pages
- J.J.J. van den Broek, C.A.J. Hurkens and G. Woeginger. Timetabling problems at the TU Eindhoven. In. E.K. Burke, H. rudova (Eds.), Practice and Theory of Automated Timetabling VI, Proceedings 6th International Conference, PATAT'06, Lecture Notes in Computer Science, Vol. 3867, pages 210-227, Berlin, Springer, 2007.
- J.J.J. van den Broek and L.G. Kroon. A capacity test for shunting movements. In. F. Geraets and others (Eds), Algorithmic Methods for Railway Optimization, (International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004 & 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers), Lecture Notes in Computer Science, Vol. 4359, Berlin, Springer, pages 108-125, 2007.
- P.A.N. Bosman, J. Grahl and D. Thierens. Adapted Maximum-Likelihood Gaussian Models for Numerical Optimization with Continuous EDAs. CWI technical report SEN-E0704, ISSN 1386-369X, 2007.
- P.A.N. Bosman. Learning and Anticipation in Online Dynamic Optimization. In S. Yang, Y.S. Ong and Y. Jin, editors, Evolutionary Computation in Dynamic and Uncertain Environments, pages 129-152, Springer-Verlag, Berlin, 2007.
- P.A.N. Bosman and H. La Poutré. Inventory Management and the Impact of Anticipation in Evolutionary Stochastic Online Dynamic Optimization. In Proceedings of the IEEE Congress on Evolutionary Computation - CEC-2007, pages 268-275, IEEE Press, Piscataway, New Jersey, 2007.
- P.A.N. Bosman and H. La Poutré. Learning and Anticipation in Online Dynamic Optimization with Evolutionary Algorithms: The Stochastic Case. In D. Thierens and others, editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2007, pages 1165-1172, ACM Press, New York, New York, 2007.
- P.A.N. Bosman and D. Thierens. Adaptive Variance Scaling in Continuous Multi-Objective Estimation-of-Distribution Algorithms. In D. Thierens and others, editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2007, pages 500-507, ACM Press, New York, New York, 2007.
- P.A.N. Bosman, J. Grahl and F. Rothlauf. SDR: A Better Trigger for Adaptive Variance Scaling in Normal EDAs. In D. Thierens and others, editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2007, pages 492-499, ACM Press, New York, New York, 2007.
- J.L. Hurink and J.J. Paulus. Special Cases of Online Parallel Job Scheduling. Technical Report Beta working paper WP-235, TUe, ISSN: 1386-9213, November 2007.
- T. Brueggemann and J.L. Hurink. Two very large-scale neighborhoods for single machine scheduling. OR Spectrum, 29 (3). pp. 513-533, 2007.
- P. de Haan, R. Landman, G.F. Post and H.W.A. and Ruizenaar. A case study for timetabling in a Dutch secondary school. In Practice and Theory of Automated Timetabling VI. Lecture Notes in Computer Science 3867, pp. 267-279, 2007.
- C. Li, J.M. van den Akker, S. Brinkkemper, and G. Diepen. Integrated Requirement Selection and Scheduling for the Release Planning of a Software Product. In: Requirements Engineering: Foundation for Software Quality, Proceedings REFSQ 2007 (Edited by Peter Sawyer, Barabar Paech, and Patrick Heymans) (volume 4542, pages 93-108), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2007
- Korteweg, Peter, Marchetti-Spaccamela, Alberto, Stougie, Leen, and Vitaletti, Andrea. Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs. In: Structural Information and Communication Complexity (Edited by Prencipe, Giuseppe and Zaks, S.) (volume 4474, pages 135-146), LNCS, Springer Verlag, Castiglioncello, Italy, 2007,
- Sven O. Krumke, Willem E. de Paepe, Joerg Rambau, and Leen Stougie. Bincoloring. 2007 Note: http://www.win.tue.nl/math/bs/spor/2007-04.pdf
- G. Diepen, J.M. van den Akker, J.A. Hoogeveen, and J.W. Smeltink. Using column generation for gate planning at Amsterdam Airport Schiphol. (Department of Information and Computing Sciences technical report CS-UU-2007-018), 2007, Utrecht University, The Netherlands
- Bonifaci, Vincenzo and Stougie, Leen. Online k-server routing problems. In: Proceedings of the 4th Workshop on Approximation and Online Algorithms (WAOA) (volume 4368, pages 83-94), LNCS, 2007
- J.A. Hoogeveen and E. Penninkx. Finding Near-Optimal Rosters Using Column Generation. (Department of Information and Computing Sciences technical report CS-UU-2007-002), 2007, Utrecht University, The Netherlands
- K. Aardal, C.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino, and A. Sassano. Models and Solution Techniques for Frequency Assignment Problems: updated. In: Annals of Operations Research (volume 153, number 1, pages 79-129), 2007
- K. Aardal and J. Byrka. The approximation gap for the metric facility location problem is not yet closed. In: Operations Research Letters (volume 35, number 3, pages 379-384), 2007
- J.M. van den Akker, G. Diepen, and J.A. Hoogeveen. A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. (Department of Information and Computing Sciences technical report CS-UU-2007-005), 2007, Utrecht University, The Netherlands
- J.M. van den Akker, G. Diepen, and J.A. Hoogeveen. A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Proceedings CPAIOR 2007 (Edited by Pascal van Hentenryck and Laurence Wolsey) (volume 4510, pages 376-390), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2007
- R. Wijgers, J.A. Hoogeveen. Column Generation Approach For Examination Timetabling. (Department of Information and Computing Sciences technical report CS-UU-2007-001), 2007, Utrecht University, The Netherlands
- Fuchs, Bernhard; Kern, Walter; Wang, Xinhui The number of tree stars is $O\sp \ast(1.357\sp k)$. Algorithmica 49 (2007), no. 3, 232-244.
- Fuchs, B.; Kern, W.; Mölle, D.; Richter, S.; Rossmanith, Peter; Wang, X. Dynamic programming for minimum Steiner trees. Theory Comput. Syst. 41 (2007), no. 3, 493-500.
- Fuchs, Bernhard; Kern, Walter; Wang, Xinhui Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees. Math. Methods Oper. Res. 66 (2007), no. 1, 117-125.
- Kern, Walter; Woeginger, Gerhard Quadratic programming and combinatorial minimum weight product problems. Math. Program. 110 (2007), no. 3, Ser. A, 641-649.
2006
- van Leeuwen, E.J., "Better Approximation Schemes for Disk Graphs" in Arge, L., Freivalds, R. (eds.) Algorithm Theory - SWAT 2006, 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, LNCS 4059, Springer-Verlag, Berlin, 2006, pp. 316-327.
- Gábor Maróti. Operations Research Models for Railway Rolling Stock planning. PhD Thesis, Eindhoven University of Technology, 2006.
- M.B. Duinkerken, R. Dekker, S.T.G.L. Kurstjens, J.A. Ottjes and N.P. Dellaert. Comparing Transportation Systems for Inter-terminal Transport at the Maasvlakte Container Terminals. In OR Spectrum, Vol. 28, pages 469-493, 2006.
- J.J.J. van den Broek, P. Schutz, L. Stougie and A. Tomasgard. Location of slaughterhouses under economies of scale. In European Journal of Operational Research, vol. 175(2), pages 740-750, 2006.
- G. Brightwell, J. van den Heuvel, and L. Stougie. A linear bound on the diameter of the transportation polytope. In: Combinatorica (volume 26, pages 133-139), 2006
- P. Schütz, L. Stougie, and A. Tomasgard. Stochastic Facility Location with General Long-Run Costs and Convex Short-Run Costs. (Technische Universiteit Eindhoven technical report SPOR-Report 2006-03), 2006
- T. Brueggemann, J.L. Hurink, T. Vredeveld, and G.J. Woeginger. Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. (University of Twente, Dep. of Mathematical Sciences technical report Memorandum No. 1801), 2006
- T. Brueggemann and J.L. Hurink. Quality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads. (University of Twente, Dep. of Mathematical Sciences technical report Memorandum No. 1808), 2006
- V. Bonifaci, P. Korteweg, A. Marchetti Spaccamela, and L. Stougie. An approximation algorithm for the Wireless Gathering Problem. In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT) (volume 4059, pages 328-338), Lecture Notes in Computer Science, Springer Verlag, Riga, Latvia, 2006
- T. Brueggemann and J.L. Hurink. Matching Based Exponential Neighborhoods for Parallel Machine Scheduling. (University of Twente, Dep. of Mathematical Sciences technical report Memorandum No. 1773), 2006
- Cheng, T.C.Edwin, Yong He, Han Hoogeveen, Min Ji, and Gerhard J. Woeginger. Scheduling with step-improving processing times. In: Operations Research Letters (volume 34, pages 37-40), 2006
- T. Brueggemann, J.L. Hurink, and W. Kern. Quality of Move-Optimal Schedules for Minimizing Total Weigted Completion Time. In: OR Letters (volume 34, pages 583-590), 2006
- J.L. Hurink, A.L. Kok, and J.J. Paulus. Decomposition Methods for Project Scheduling with Spatial Resources. (TUe technical report BETA working paper WP-181), 2006
- T.A. Guldemond, J.L. Hurink, J.J. Paulus, and J.M.J. Schutten. Time-Constrained Project Scheduling. (TUe technical report BETA working paper WP-180), 2006
- S.O. Krumke, W. de Paepe, D. Poensgen, M. Lipmann, A. Marchetti-Spaccamela, and L. Stougie. On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. In: In Proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA) (volume 3879, pages 258-269), Lecture Notes in Computer Science, Springer Verlag, Palma de Mallorca, Spain, 2005, 2006
- M.E. Dyer and L. Stougie. Computational complexity of stochastic programming problems. In: Mathematical Programming (volume 106, pages 423-432), 2006
- Post, G. and Woeginger, G.J. Sports tournaments, home-away assignments, and the break minimization problem. In: Discrete Optimization (volume 3, pages 165-173), 2006
- M. Cryan, M. Dyer, H. Mller, and L. Stougie. Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources. (Technische Universiteit Eindhoven technical report SPOR-Report 2006-07), 2006
- T. Brueggemann and J.L. Hurink. Two Very Large-Scale Neighborhoods for Single Machine Scheduling. (University of Twente, Dep. of Mathematical Sciences technical report Memorandum No. 1776), 2006 Note: to appear in OR Spectrum (2006)
- V. Bonifaci, M. Lipmann, and L. Stougie. Online multi-server dial-a-ride problems. (Technische Universiteit Eindhoven technical report SPOR-Report 2006-04), 2006
- R. Sitters and L. Stougie. The generalized two-server problem. In: Journal of the ACM (volume 53, pages 1-22), 2006
- L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skutella, L. Stougie, and A. Vitaletti. Latency Constrained Aggregation in Sensor Networks. In: In Proceedings of the 14th European Symposium on Algorithms (ESA) (volume 4168, pages 88-99), Lecture Notes in Computer Science, Springer Verlag, Zürich, Switzerland, 2006
- J.C.M. Keijsper, R.A. Pendavingh, and L. Stougie. A linear programming formulation of Mader's edge-disjoint paths problem. In: Journal of Combinatorial Theory (pages 159-163), 2006
- W.K. Klein Haneveld, L. Stougie, and M.H. van der Vlerk. Simple Integer Recourse Models: Convexity and Convex Approximations. In: Mathematical Programming (pages 435-474), 2006
- Fuchs, Bernhard; Kern, Walter; Wang, Xinhui The number of tree stars is $O\sp *(1.357\sp k)$. CTW2006--Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 183-185 (electronic), Electron. Notes Discrete Math., 25, Elsevier, Amsterdam, 2006.
- Faigle, Ulrich; Kern, Walter; Kuipers, Jeroen Computing an element in the lexicographic kernel of a game. Math. Methods Oper. Res. 63 (2006), no. 3, 427-433.
- Kern, Walter; Woeginger, Gerhard Quadratic programming and combinatorial minimum weight product problems. Algorithms and complexity, 42-49, Lecture Notes in Comput. Sci., 3998, Springer, Berlin, 2006.
- Pop, Petrica C.; Kern, W.; Still, G. A new relaxation method for the generalized minimum spanning tree problem. European J. Oper. Res. 170 (2006), no. 3, 900-908.
2005
- H. Akkermans and N.P. Dellaert. The Rediscovery of Industrial Dynamics: The Contribution of System Dynamics to Supply Chain Management in a Dynamic and Fragmented World. In System Dynamics Review, Vol. 21, pages 173-186, 2005.
- N.P. Dellaert and J. Jeunet. An Alternative to Safety Stock Policies for Multi-Level Rolling Schedule MR P problems. In European Journal of Operational Research, Vol. 163, pages 751-768, 2005.
- J.M. Spitter, A.G. de Kok and N.P. Dellaert. Timing Production in LP Models in A Rolling Schedule. In International Journal of Production Economics, Vol. 93-4, pages 319-329, 2005.
- Steven S. Seiden, Gerhard J. Woeginger. The two-dimensional cutting stock problem revisited. In: Mathematical Programming (volume 102, pages 519-530), 2005
- Gerhard J. Woeginger. More on the majority rule: Profiles, societies, and responsiveness. In: Economics Letters (volume 88, pages 7-11), 2005
- Gerhard J. Woeginger. Formulations, relaxations, approximations, and gaps in the world of scheduling. In: Multidisciplinary Scheduling: Theory and Applications (Edited by G. Kendall, E. Burke, S. Petrovic, and M. Gendreau) (pages 19-36), Springer, Berlin, 2005
- van Leeuwen, Erik Jan. Approximation Algorithms for Unit Disk Graphs. In: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005) (Edited by Kratsch, D.) (volume 3787, pages 351-361), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2005
- Gerhard J. Woeginger. A comment on scheduling two parallel machines with capacity constraints. In: Discrete Optimization (volume 2, pages 269-272), 2005
- Gerhard J. Woeginger. Combinatorial approximation algorithms: A comparative review. In: Operations Research Letters (volume 33, pages 210-215), 2005
- Frits C.R. Spieksma, Gerhard J. Woeginger. The flow-shop paradox. In: Operations Research Letters (volume 33, pages 603-608), 2005
- J. Geelen and B. Gerards. Regular matroid decomposition via signed graphs. In: Journal of Graph Theory (volume 48, pages 74-84), 2005
- Attila Kuba and Gerhard J. Woeginger. Two remarks on reconstructing binary matrices from their absorbed projections. In: Proceedings of the 12th International Conference on Discrete Geometry for Computer Imagery (DGCI'2005) (volume 3429, pages 148-152), Lecture Notes in Computer Science, Springer Verlag, Berlin, 2005
- Van den Akker, J.M., S. Brinkkemper, G. Diepen, and J. Versendaal. Determination of the Next Release of a Software Product: an Approach using Integer Linear Programming. In: Proceeding of the CAISE'05 FORUM, The 17th conference on Advanced Information Systems Engineering (Edited by Orlando Belo, Johann Eder, Oscar Pastor, and Joao Falcao e Cunha) (pages 119-124), 2005
- A. Vandevelde, J.A. Hoogeveen, C.A.J. Hurkens, and J.K. Lenstra. Lower bounds for the head-body-tail problem on parallel machines: a computational study for the multiprocessor flow shop. In: INFORMS Journal on Computing (volume 16, pages 305-320), 2005
- Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, and Yunhong Zhou. Server Allocation Algorithms for Tiered Systems. In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings (Edited by Lusheng Wang) (volume 3595, pages 632-643), Lecture Notes in Computer Science, Springer, 2005
- C.J. Luz and A. Schrijver. A convex quadratic characterization of the Lovász theta number. In: SIAM Journal on Discrete Mathematics (volume 19, pages 382-387), 2005
- Willem-Jan van Hoeve. Operations Research Techniques in Constraint Programming. Phd Thesis, Universiteit van Amsterdam, 2005
- Davaatseren Baatar, Matthias Ehrgott, Horst W. Hamacher, and Gerhard J. Woeginger. Decomposition of integer matrices and multileaf collimator sequencing. In: Discrete Applied Mathematics (volume 152, pages 6-34), 2005
- A. Schrijver. New code upper bounds from the Terwilliger algebra and semidefinite programming. In: IEEE Transactions on Information Theory (volume 51, pages 2859-2866), 2005
- Arianna Alfieri, Steef van de Velde, and Gerhard J. Woeginger. Roll cutting in the curtain industry. In: Proceedings of the 13th Annual European Symposium on Algorithms (ESA'2005) (volume 3429, pages 283-292), Lecture Notes in Computer Science, Springer Verlag, Berlin, 2005
- L. Stougie and M.H. van der Vlerk. Approximation in Stochastic Integer Programming. (Technische Universiteit Eindhoven technical report SPOR-Report 2005-10), 2005
- Maróti G. and Kroon, L.G. Maintenance Routing for Train Units: the Transition Model. In: Transportation Science (volume 39, number 4, pages 518-525), 2005
- Mark Cieliebak, Stephan Eidenbenz, and Gerhard J. Woeginger. Complexity and approximability of double digest. In: Journal of Bioinformatics and Computational Biology (volume 3, pages 1-17), 2005
- . Handbook on Discrete Optimization. (Edited by K. Aardal, G.L. Nemhauser, and R. Weismantel) (volume 12), Handbooks in Operations Research and Management Science, Elsevier, Amsterdam, 2005
- Satyaveer S. Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, and Gerhard J. Woeginger. Approximation of the supply management problem. In: Operations Research Letters (volume 33, pages 249-254), 2005
- Bettina Klinz and Gerhard J. Woeginger. Faster algorithms for computing power indices in weighted majority games. In: Mathematical Social Sciences (volume 49, pages 111-116), 2005
- L. Stougie and M.H. van der Vlerk. Approximation in Stochastic Integer Programming. (Technische Universiteit Eindhoven technical report SPOR-Report 2005-10), 2005
- C.A.J. Hurkens, J.C.M. Keijsper, and L. Stougie. Virtual private network design: a proof of the tree routing conjecture on ring networks. In: Proceedings of the 11th International IPCO Conference (Edited by W.J. Cook, V. Kaibel) (volume 3509, pages 407-421), Springer-Verlag, Berlin, 2005
- Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, and Shenggui Zhang. Paths and cycles in colored graphs. In: Australasian Journal of Combinatorics 31 (pages 299-311), 2005
- Van den Akker, J.M., S. Brinkkemper, G. Diepen, and J. Versendaal. Flexible Release Planning using Integer Linear Programming. In: Proceeding of the 11th International Workshop on Requirements Engineering: Foundation for Software Quality REFSQ'05 (Edited by Erik Kamsties, Vincenzo Gervasi, and Pete Sawyer) (volume Band 10, pages 247-262), 2005
- A. Schrijver. 1. In: On the history of combinatorial optimization (till 1960) (Edited by K. Aardal, G.L. Nemhauser, and R. Weismantel) (pages 1-68), Elsevier, Amsterdam, 2005
- Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger. Minimizing makespan and preemption costs on a system of uniform machines. In: Algorithmica (volume 42, pages 309-334), 2005
- K. Aardal. Lattice basis reduction in integer linear optimization: Some basic topics. In: SIAM Activity Group on Optimization Newsletter (volume 16, pages 20-27), 2005
- K. Aardal and F. Eisenbrand. 4. In: Integer Programming, Lattices and Results in Fixed Dimension (Edited by K. Aardal, G.L. Nemhauser, and R. Weismantel) (pages 171-243), Elsevier, Amsterdam, 2005
- Pop, Petrica C.; Still, G.; Kern, W. Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem. Rev. Anal. Numér. Théor. Approx. 34 (2005), no. 1, 93-102.
- Fuchs, Bernhard; Hochstättler, Winfried; Kern, Walter Online matching on a line. Theoret. Comput. Sci. 332 (2005), no. 1-3, 251-264.
2004
- N.P. Dellaert and A.G. de Kok. Integrating Resource and Production Decisions in a Simple Multi-Stage Assembly System. In International Journal of Production Economics, Vol. 90, pages 281-294, 2004.
- M. Lipmann, X. Lu, W.E. de Paepe, R.A. Sitters, and L. Stougie. On-line dial-a-ride problems under a restricted information model. In: Algorithmica (volume 40, pages 319-329), 2004
- W.J. van Hoeve, G. Pesant, and L.-M. Rousseau. On Global Warming (Softening Global Constraints). In: Proceedings of the 6th International Workshop on Preferences and Soft Constraints, 2004
- W.E. de Paepe, J.K. Lenstra, J. Sgall, R.A. Sitters, and L. Stougie. Computer-aided complexity classification of dial-a-ride problems. In: INFORMS Journal on Computing (volume 16, pages 120-132), 2004
- G. Maróti and L.G. Kroon. Maintenance Routing for Train Units: the Transition Model. (CWI technical report PNA-E0415), 2004
- A. Schrijver, R. Lentink, and L.G. Kroon. Shunting of Passenger Train Units: an Integrated Approach. Preprint, (http://www.cwi.nl/~lex/files/PlanningOfShuntTracks.pdf). 2004
- P.J. Fioole, L.G. Kroon, G. Maróti, and A. Schrijver. A rolling stock circulation model for combining and splitting of passenger trains. (CWI technical report PNA-E0420), 2004
- W.J. van Hoeve. A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint. In: Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004) (Edited by M. Wallace) (volume 3258, pages 679-689), LNCS, Springer Verlag, 2004
- K. Aardal. Comments on the paper: Attacking the market split problem with lattice point enumeration. In: Journal of Combinatorial Optimization (volume 8, pages 147-149), 2004
- W.J. van Hoeve and M. Milano. Postponing Branching Decisions. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004) (pages 1105-1106), IOS Press, 2004
- K.I. Aardal and F. Eisenbrand. Integer programming, lattices, and results in fixed dimension. (CWI technical report PNA-E0421), 2004
- K. Aardal and A.K. Lenstra. Hard equality constrained knapsack problems. In: Mathematics of Operations Research (volume 29, pages 724-738), 2004
- G. Maróti and L.G. Kroon. Maintenance Routing for Train Units: the Scenario Model. (CWI technical report PNA-E0414), 2004
- Brueggemann, Tobias; Kern, Walter An improved local search algorithm for 3-SAT. Workshop on Graphs and Combinatorial Optimization, 69-73 (electronic), Electron. Notes Discrete Math., 17, Elsevier, Amsterdam, 2004.
- Nieberg, Tim; Hurink, Johann; Kern, Walter A robust PTAS for maximum weight independent sets in unit disk graphs. Graph-theoretic concepts in computer science, 214-221, Lecture Notes in Comput. Sci., 3353, Springer, Berlin, 2004.
- Brueggemann, Tobias; Kern, Walter An improved deterministic local search algorithm for 3-SAT. Theoret. Comput. Sci. 329 (2004), no. 1-3, 303-313.
- Kern, Walter; Paulusma, Daniël The computational complexity of the elimination problem in generalized sports competitions. Discrete Optim. 1 (2004), no. 2, 205-214.
- Erdös, Peter L.; Faigle, Ulrich; Hochstättler, Winfried; Kern, Walter Note on the game chromatic index of trees. Algorithmic combinatorial game theory. Theoret. Comput. Sci. 313 (2004), no. 3, 371-376.
|
