Capacitated Facility Location: Valid Inequalities and Facets. - Karen I. Aardal; Yves Pochet; Laurence A. Wolsey (Math. Oper. Res., 1995)

On the Two-Level Uncapacitated Facility Location Problem. - Karen I. Aardal; Martine Labbé; Janny Leung; Maurice Queyranne (INFORMS J. Comput., 1996)

Approximation Algorithms for Facility Location Problems (Extended Abstract). - David B. Shmoys; Éva Tardos; Karen I. Aardal (STOC, 1997)

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. - Karen I. Aardal; Cor A. J. Hurkens; Arjen K. Lenstra (IPCO, 1998)

Reformulation of capacitated facility location problems: How redundant information can help. - Karen I. Aardal (Ann. Oper. Res., 1998)

Capacitated facility location: Separation algorithms and computational experience. - Karen I. Aardal (Math. Program., 1998)

An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. - Bram Verweij; Karen I. Aardal (ESA, 1999)

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (IPCO, 1999)

A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. - Karen I. Aardal; Fabián A. Chudak; David B. Shmoys (Inf. Process. Lett., 1999)

Factorization of a 512-Bit RSA Modulus. - Stefania Cavallar; Bruce Dodson; Arjen K. Lenstra; Walter M. Lioen; Peter L. Montgomery; Brian Murphy; Herman J. J. te Riele; Karen I. Aardal; Jeff Gilchrist; Gérard Guillerm; Paul C. Leyland; Joël Marchand; et al. (EUROCRYPT, 2000)

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. - Karen I. Aardal; Robert E. Bixby; Cor A. J. Hurkens; Arjen K. Lenstra; Job W. Smeltink (INFORMS J. Comput., 2000)

Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. - Karen I. Aardal; Cor A. J. Hurkens; Arjen K. Lenstra (Math. Oper. Res., 2000)

Hard Equality Constrained Integer Knapsacks. - Karen I. Aardal; Arjen K. Lenstra (IPCO, 2002)

Non-standard approaches to integer programming. - Karen I. Aardal; Robert Weismantel; Laurence A. Wolsey (Discret. Appl. Math., 2002)

Algorithms for Radio Link Frequency Assignment: The Calma Project. - Karen I. Aardal; Cor A. J. Hurkens; Jan Karel Lenstra; Sergey R. Tiourine (Oper. Res., 2002)

Models and solution techniques for frequency assignment problems. - Karen I. Aardal; Stan P. M. van Hoesel; Arie M. C. A. Koster; Carlo Mannino; Antonio Sassano (4OR, 2003)

Algebraic and geometric methods in discrete optimization. - Karen I. Aardal; Rekha R. Thomas (Math. Program., 2003)

The merchant subtour problem. - Bram Verweij; Karen I. Aardal (Math. Program., 2003)

Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. - Karen I. Aardal (J. Comb. Optim., 2004)

The approximation gap for the metric facility location problem is not yet closed. - Jaroslaw Byrka; Karen I. Aardal (Oper. Res. Lett., 2007)

Facility Location. - Karen I. Aardal; Jaroslaw Byrka; Mohammad Mahdian (Encyclopedia of Algorithms, 2008)

Lattice based extended formulations for integer linear equality systems. - Karen I. Aardal; Laurence A. Wolsey (Math. Program., 2010)

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. - Jaroslaw Byrka; Karen I. Aardal (SIAM J. Comput., 2010)

The LLL Algorithm and Integer Programming. - Karen I. Aardal; Friedrich Eisenbrand (The LLL Algorithm, 2010)

Evaluating dynamic dispatch strategies for emergency medical services: TIFAR simulation tool. - Martin van Buuren; Rob van der Mei; Karen I. Aardal; Henk Post (WSC, 2012)

On the Structure of Reduced Kernel Lattice Bases. - Karen I. Aardal; Frederik von Heymann (IPCO, 2013)

Approximation algorithms for the transportation problem with market choice and related models. - Karen I. Aardal; Pierre Le Bodic (Oper. Res. Lett., 2014)

Approximation algorithms for hard capacitated k-facility location problems. - Karen I. Aardal; Pieter L. van den Berg; Dion Gijswijt; Shanfei Li (Eur. J. Oper. Res., 2015)

Time-dependent MEXCLP with start-up and relocation cost. - Pieter L. van den Berg; Karen I. Aardal (Eur. J. Oper. Res., 2015)

A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem. - R. B. O. Kerkkamp; Karen I. Aardal (Oper. Res. Lett., 2016)

Facility Location. - Karen I. Aardal; Jaroslaw Byrka; Mohammad Mahdian (Encyclopedia of Algorithms, 2016)

Lattice Reformulation Cuts. - Karen I. Aardal; Andrea Lodi 001; Andrea Tramontani; Frederik von Heymann; Laurence A. Wolsey (SIAM J. Optim., 2021)

Learning to Branch with Tree MDPs. - Lara Scavuzzo; Feng Yang Chen; Didier Chételat; Maxime Gasse; Andrea Lodi 001; Neil Yorke-Smith; Karen I. Aardal (NeurIPS, 2022)

A Polynomial Size Model with Implicit SWAP Gate Counting for Exact Qubit Reordering. - Jesse Mulderij; Karen I. Aardal; Irina Chiscop; Frank Phillipson (ICCS (5), 2023)

A study of lattice reformulations for integer programming. - Karen I. Aardal; Lara Scavuzzo; Laurence A. Wolsey (Oper. Res. Lett., 2023)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming. - Lara Scavuzzo; Karen I. Aardal; Andrea Lodi 001; Neil Yorke-Smith (CoRR, 2024)

Learning optimal objective values for MILP. - Lara Scavuzzo; Karen I. Aardal; Neil Yorke-Smith (CoRR, 2024)

Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources. - T. van der Beek; Dimitris Souravlias; J. Theresia van Essen; Jeroen Pruyn; Karen I. Aardal (Eur. J. Oper. Res., 2024)

Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. - Karen I. Aardal; Laura Sanità (Math. Program., 2024)

Tight and Compact MILP Models for Storage Operation and Unit Commitment. - Maaike B. Elgersma; Germán Morales-España; Karen I. Aardal; Mathijs Michiel de Weerdt (e-Energy, 2025)

Exact solution methods for the Resource Constrained Project Scheduling Problem with a flexible Project Structure. - T. van der Beek; J. Theresia van Essen; Jeroen Pruyn; Karen I. Aardal (Eur. J. Oper. Res., 2025)

Machine learning assisted Differential Evolution for the Dynamic Resource Constrained Multi-project Scheduling Problem with Static project Schedules. - T. van der Beek; J. Theresia van Essen; Jeroen Pruyn; Karen I. Aardal (Eur. J. Oper. Res., 2025)

Jacques Benders and his decomposition algorithm. - Karen I. Aardal; Cor A. J. Hurkens; Jan Karel Lenstra (Oper. Res. Lett., 2025)