Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K. & Tiourine, S. (2002). Algorithms for radio link frequency assignment: The CALMA project. Annals of Operations Research, 50(6), 968-980.
|
Aardal, K.I. (2002). Experimental Algorithms.
|
Aardal, K.I. (2002). Geometric Convex Combinatorics.
|
Aardal, K.I. (2002). Hard equality constrained integer knapsacks. 9th International IPCO Conference: MIT, Cambridge MA (2002, May 27 - 2002, May 29).
|
Aardal, K.I. & Lenstra, A.K. (2002). Hard equality constrained knapsacks. Lecture Notes in Computer Science, 2337, 350-366.
|
Aardal, K.I. (2002). Large Scale Integer Programming.
|
Aardal, K.I. (2002). Lid Program Committee, 10th European Symposium on Algorithms.
|
Aardal, K.I. (2002). Lidmaatschap INFORMS.
|
Aardal, K.I. (2002). Lidmaatschap Mathematical Programming Society.
|
Aardal, K.I. (2002). Lidmaatschap SIAM.
|
Aardal, K.I., Weismantel, R. & Wolsey, L.A. (2002). Non-standard approaches to integer programming. Discrete Applied Mathematics, 123, 5-74.
|
Aardal, K.I. (Ed.). (2002). INFORMS Journal on Computing, 14(1-4).
|
Aardal, K.I. (Ed.). (2002). Mathematical Programming, 91, 92.
|
Aardal, K.I. (Ed.). (2002). Operations Research Letters, 30(1-6).
|
Aardal, K.I. (Ed.). (2002). Applied mathematics & optimization Online.
|
Aardal, K.I. & Lenstra, A.K. (2001, November 4). Hard integer equality constrained knapsack problems. Miami Beach, FL, U.S.A., INFORMS Annual meeting 2001.
|
Aardal, K.I. & Lenstra, A.K. (2001, March 5). Hard integer equality-constrained knapsack problems. Aussois, France, Fifth Aussios Workshop on Combinatorial Optimization.
|
Aardal, K.I. & Gerards, A.M.H. (2001). Integer Programming and Combinatorial Optimization : 8th International IPCO Conference (LNCS, 2081). Berlin: Springer-Verlag.
|
Aardal, K.I., Hoesel, C.P.M., Koster, A.M.C.A., Mannino, C. & Sassano, A. (2001). Models and solution techniques for the frequency assignment problem. Berlin, Germany: Konrad-Zuse-Zentrum für Informationstechnik.
|
Aardal, K.I. & Kelton, D. (Eds.). (2001). INFORMS Journal on Computing, 13.
|
Aardal, K.I. (Ed.). (2001). Mathematical Programming, 89-91.
|
Aardal, K.I. & Nemhauser, G.L. (Eds.). (2001). Operations Research Letters, 28-29.
|
Aardal, K.I. (2001). [Book review Discrete and fractional programming techniques for location models]. Nieuw archief voor wiskunde, 5(2), 85-85.
|
Strijk, T.W., Verweij, A.M. & Aardal, K.I. (2000). Algorithms for maximum independent set applied to map labelling. (UU-CS2000-22 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W., Montgomery, P.L., Murphy, B., Riele, H. te, Aardal, K.I., Gilchrist, J., Guillerm, G., Leyland, P., Marchand, J., Morain, F., Muffet, A., Putnam, C. & Zimmerman, P. (2000). Factorization of a 512-bit RSA Modulus. In B. Preneel (Ed.), Advances in Cryptology -- EUROCRYPT2000, Lecture Notes in Computer Science (pp. 1-18). Berlin: Springer-Verlag.
|
Aardal, K.I. Lattices and integer programming. Rotterdam, Nederland, 5th International Conference on High Performance Optimization Techniques.
|
Aardal, K.I. Lattices, bases, and reduction. Rotterdam, Nederland, 5th International Conference on High Performance Optimization Techniques.
|
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K. & Smeltink, J.W. (2000). Market split and basis reduction: Towards a solution of the Cornuejols-Dawande instances. INFORMS Journal on Computing, 12, 192-202.
|
Aardal, K.I. (2000). Perspectives on integer programming. Nieuwsbrief van de NVTI, 4, 13-20.
|
Aardal, K.I., Hurkens, C.A.J. & Lenstra, A.K. (2000). Solving a system of diophantine equations with lower and upper bounds on the variables. Mathematics of Operations Research, 25, 427-442.
|
Aardal, K.I., Hurkens, C.A.J. & Lenstra, A.K. Solving hard and integer problems using basis reduction. Atlanta, GA, USA, 17th International Symposium on Mathematical Programming.
|
Aardal, K.I., Hurkens, C.A.J. & Lenstra, A.K. Solving hard integer programs using lattice basis reduction. Utrecht, Nederland, 8th HPMMO one-day seminar.
|
Aardal, K.I. & Kelton, D. (Eds.). (2000). INFORMS Journal on Computing, 12.
|
Cook, W. & Aardal, K.I. (Eds.). (2000). Mathematical Programming, 88-89.
|
Nemhauser, G.L. & Aardal, K.I. (Eds.). (2000). Operations Research Letters, 26-27.
|
Verweij, A.M. & Aardal, K.I. (2000). The merchant subtour problem. (UU-CS2000-35 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I., Chudak, F.A. & Shmoys, D.B. (1999). A 3-approximation algorithm for the k-level uncapacitated facility location Problem. Information Processing Letters, 72, 161-167.
|
Aardal, K.I., Chudak, F.A. & Shmoys, D.B. (1999). A 3-approximation algorithm for the k-level uncapacitated facility location Problem. Houston TX, USA: Center for Research on Parallel Computation, Rice University.
|
Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K. & Tiourine, S. (1999). Algorithms for the radio link frequency assignment problem. (UU-CS1999-36 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K. & Tiourine, S. (1999). Algorithms for the radio link frequency assignment problem. (COSOR 9917 ). Eindhoven, the Netherlands: Eindhoven, University of Technology.
|
Verweij, A.M. & Aardal, K.I. (1999). An optimisation algorithm for maximum independent set with aplications in map labelling. In Proceedings ESA '99 (pp. 426-437).
|
Aardal, K.I. (1999). Lattice basis reduction and integer programming. (UU-CS1999-37 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K. & Smeltink, J.W. (1999). Market Split and Basis Reduction: Towards a solution of the Cornuéjols-Dawande Instances. In G. Cornuéjols, R.E. Burkhard & G.J. Woeginger (Eds.), Proceedings IPCO '99 (pp. 1-16). Berlin: Springer - Verlag.
|
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K. & Smeltink, J.W. (1999). Market split and basis reduction: Towards a solution of the Cornuejols-Dawande Instances. (UU-CS1999-16 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K. & Smeltink, J.W. (1999). Market split and basis reduction: Towards a solution of the Cornuejols-Dawande instances. Houston, TX: Rice University.
|
Aardal, K.I., Weismantel, R. & Wolsey, L.A. (1999). Non-standard approaches to integer programming. (UU-CS1999-41 ). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I. & Hoesel, S.P.M. van (1999). Polyhedral techniques in combinatorial optimization II: Applications and computations. Statistica Neerlandica : orgaan van de Vereniging voor Statistiek, 53, 129-178.
|
Aardal, K.I., Lenstra, J.K., Maffioli, F. & Shmoys, D.B. (1999). Selected Publications of Eugene L. Lawler, CWI Tract 126. Amsterdam: CWI.
|
Aardal, K.I. (1998). A 3-approximation algorithm for the k-level uncapacitated facility location problem. (UU-CS1998-45 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I. (1998). Capacitated facility location: Separation algorithms and computational experience. Mathematical Programming, 81, 149-175.
|
Aardal, K.I. (1998). Reformulation of capacitated facility location problems: How redundant information can help. Annals of Operations Research, 82, 289-308.
|
Aardal, K.I., Hurkens, C.A.J. & Lenstra, A.K. (1998). Solving a linear diophantine equation with bounds on the variables. In Proceedings Integer Programming and Combinatorial Optimization (IPCO VI) (pp. 229-242). Berlin: Springer Verlag.
|
Aardal, K.I. (1998). Solving a system of diophantine equations with lower and upper bounds on the variables. (UU-CS1998-36 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I. (1997). A decade of combinatorial optimization. (UU-CS1997-12 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I., Hoesel, S. van, Lenstra, J.K. & Stougie, L. (1997). A decade of combinatorial optimization. In CWI Tracts (CWI Tracts, 122) (pp. 5-14).
|
Aardal, K.I. (1997). An algorithm for solving a diophantine equation with lower and upper bounds on the variables. (UU-CS1997-40 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Shmoys, D.B. & Aardal, K.I. (1997). Approximation algorithms for facility location problems. (UU-CS1997-39 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Shmoys, D.B., Tardos, E. & Aardal, K.I. (1997). Approximation algortihms for facility location problems. In Proceedings 29th Ann. Symposium on Theory of Computing (STOC'97) (pp. 265-274). New York: ACM-press.
|
Verweij, B., Aardal, K.I. & Kant, G. (1997). On a routing problem from the airplane manufacturing industry. In Abstract WB 27.3, Conference Record EURO XV/INFORMS XXXIV Joint Int. Conference Barcelona (pp. 133-133). Barcelona.
|
Verweij, A.M., Aardal, K.I. & Kant, G. (1997). On an integer multicommodity flow problem from the airplane industry. (UU-CS1997-38 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I. & Weismantel, R. (1997). Polyhedral combinatorics (chapter 3). In M. Dell'Amico, F. Mafioli & S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley.
|
Gill, R.D., Dajani, K. & Aardal, K.I. (1996). Probabilistic Algorithms. workshop: Utrecht (1996, February 21).
|
Aardal, K.I., Hurkens, C.A.J., Lenstra, J.K. & Tiourine, S.R. (1996). Algorithms for frequency assignment problems (extended abstract). CWI Quarterly, 9, 1-8.
|
Aardal, K.I., Labbe, M., Leung, J. & Queyranne, M. (1996). On the two-level uncapacitated facility location problem. INFORMS Journal on Computing, 8, 289-301.
|
Aardal, K.I. (1996). Polyhedral combinatorics: An annotated bibliography. (UU-CS1996-27 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Aardal, K.I. & Hoesel, S.P.M. van (1996). Polyhedral techniques in combinatorial optimization. Statistica Neerlandica : orgaan van de Vereniging voor Statistiek, 50, 3-26.
|
Aardal, K.I. (1996). Reformulation of capacitated facility location problems: How redundant information can help. (UU-CS1996-53 ). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Gill, R.D., Dajani, K. & Aardal, K.I. (1996). workshop Probabilistic Algorithms and Algorithmic Probability (PAAP). workshop: Utrecht (1996, May 29 - 1996, May 30).
|
Aardal, K.I. (1995). Capacitated facility location: separation algorithms and computational experience. (UU-CS1995-35 ). Utrecht: Utrecht University.
|
Aardal, K.I. (1995). On the two-level uncapacitated facility location problem. (UU-CS1995-41 ). Utrecht: Utrecht University.
|
Aardal, K.I. (1995). Polyhedral techniques in combinatorial optimization II: Computations. (UU-CS1995-42 ). Utrecht: Utrecht University.
|
Aardal, K.I. (1995). Polyhredral techniques in combinatorial optimization I: Theory. (UU-CS1995-29 ). Utrecht: Utrecht University.
|
webmaster@cs.uu.nl,
Sun, 26 May 2013 10:53:46 +0200
←
Departement Informatica, Universiteit Utrecht