Karen Aardal

Publication Activity (10 Years)

Years Active: 1995-2022
Publications (10 Years): 6

Top Topics

Transportation Problem

Constant Factor

Approximation Algorithms

Top Venues

Oper. Res. Lett.

Eur. J. Oper. Res.

Publications

Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen Aardal
Learning to Branch with Tree MDPs. NeurIPS (2022)
Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen Aardal
Learning to branch with Tree MDPs. CoRR (2022)
Karen Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey
Lattice Reformulation Cuts. SIAM J. Optim. 31 (4) (2021)
R. B. O. Kerkkamp, Karen Aardal
A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem. Oper. Res. Lett. 44 (3) (2016)
Karen Aardal, Pieter L. van den Berg, Dion Gijswijt, Shanfei Li
Approximation algorithms for hard capacitated k-facility location problems. Eur. J. Oper. Res. 242 (2) (2015)
Pieter L. van den Berg, Karen Aardal
Time-dependent MEXCLP with start-up and relocation cost. Eur. J. Oper. Res. 242 (2) (2015)
Karen Aardal, Pierre Le Bodic
Approximation algorithms for the Transportation Problem with Market Choice and related models. CoRR (2014)
Karen Aardal, Frederik von Heymann
On the Structure of Reduced Kernel Lattice Bases. Math. Oper. Res. 39 (3) (2014)
Karen Aardal, Pierre Le Bodic
Approximation algorithms for the transportation problem with market choice and related models. Oper. Res. Lett. 42 (8) (2014)
Karen Aardal, Frederik von Heymann
On the Structure of Reduced Kernel Lattice Bases. IPCO (2013)
Martin van Buuren, Rob van der Mei, Karen Aardal, Henk Post
Evaluating dynamic dispatch strategies for emergency medical services: TIFAR simulation tool. WSC (2012)
Jaroslaw Byrka, Karen Aardal
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. SIAM J. Comput. 39 (6) (2010)
Karen Aardal, Laurence A. Wolsey
Lattice based extended formulations for integer linear equality systems. Math. Program. 121 (2) (2010)
Jaroslaw Byrka, Karen Aardal
The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. 35 (3) (2007)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153 (1) (2007)
Karen Aardal, Arjen K. Lenstra
Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. 29 (3) (2004)
Karen Aardal
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. J. Comb. Optim. 8 (2) (2004)
Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
Models and solution techniques for frequency assignment problems. 4OR 1 (4) (2003)
Karen Aardal, Rekha R. Thomas
Algebraic and geometric methods in discrete optimization. Math. Program. 96 (2) (2003)
Bram Verweij, Karen Aardal
The merchant subtour problem. Math. Program. 94 (2-3) (2003)
Karen Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50 (6) (2002)
Karen Aardal, Arjen K. Lenstra
Hard Equality Constrained Integer Knapsacks. IPCO (2002)
Karen Aardal, Robert Weismantel, Laurence A. Wolsey
Non-standard approaches to integer programming. Discret. Appl. Math. 123 (1-3) (2002)
Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. INFORMS J. Comput. 12 (3) (2000)
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann
Factorization of a 512-Bit RSA Modulus. EUROCRYPT (2000)
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables. Math. Oper. Res. 25 (3) (2000)
Bram Verweij, Karen Aardal
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. ESA (1999)
Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances. IPCO (1999)
Karen Aardal, Fabián A. Chudak, David B. Shmoys
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem. Inf. Process. Lett. 72 (5-6) (1999)
Karen Aardal
Reformulation of capacitated facility location problems: How redundant information can help. Ann. Oper. Res. 82 (1998)
Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO (1998)
Karen Aardal
Capacitated facility location: Separation algorithms and computational experience. Math. Program. 81 (1998)
David B. Shmoys, Éva Tardos, Karen Aardal
Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC (1997)
Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne
On the Two-Level Uncapacitated Facility Location Problem. INFORMS J. Comput. 8 (3) (1996)
Karen Aardal, Yves Pochet, Laurence A. Wolsey
Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20 (3) (1995)