default search action
Karen I. Aardal
Person information
- affiliation: Delft University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]T. van der Beek
, Dimitris Souravlias, J. Theresia van Essen
Hybrid differential evolution algorithm for the resource constrained project scheduling problem with a flexible project structure and consumption and production of resources. Eur. J. Oper. Res. 313(1): 92-111 (2024) - [j26]Karen I. Aardal, Laura Sanità:
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2022. Math. Program. 206(1): 1-2 (2024) - [i4]Lara Scavuzzo, Karen I. Aardal, Andrea Lodi, Neil Yorke-Smith:
Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming. CoRR abs/2402.05501 (2024) - 2023
- [j25]Karen I. Aardal
A study of lattice reformulations for integer programming. Oper. Res. Lett. 51(4): 401-407 (2023) - [c10]Jesse Mulderij
A Polynomial Size Model with Implicit SWAP Gate Counting for Exact Qubit Reordering. ICCS (5) 2023: 72-89 - 2022
- [c9]Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen I. Aardal:
Learning to Branch with Tree MDPs. NeurIPS 2022 - [e2]Karen I. Aardal
Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Lecture Notes in Computer Science 13265, Springer 2022, ISBN 978-3-031-06900-0 [contents] - [i3]Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen I. Aardal:
Learning to branch with Tree MDPs. CoRR abs/2205.11107 (2022) - 2021
- [j24]Karen I. Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey:
Lattice Reformulation Cuts. SIAM J. Optim. 31(4): 2539-2557 (2021) - 2020
- [i2]Jesse Mulderij, Karen I. Aardal, Irina Chiscop, Frank Phillipson:
A polynomial size model with implicit SWAP gate counting for exact qubit reordering. CoRR abs/2009.08748 (2020)
2010 – 2019
- 2016
- [j23]R. B. O. Kerkkamp, Karen I. Aardal:
A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem. Oper. Res. Lett. 44(3): 329-335 (2016) - [r2]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2016: 717-724 - 2015
- [j22]Karen I. Aardal, Pieter L. van den Berg
Approximation algorithms for hard capacitated k-facility location problems. Eur. J. Oper. Res. 242(2): 358-368 (2015) - [j21]Pieter L. van den Berg
Time-dependent MEXCLP with start-up and relocation cost. Eur. J. Oper. Res. 242(2): 383-389 (2015) - 2014
- [j20]Karen I. Aardal, Frederik von Heymann:
On the Structure of Reduced Kernel Lattice Bases. Math. Oper. Res. 39(3): 823-840 (2014) - [j19]Karen I. Aardal, Pierre Le Bodic
Approximation algorithms for the transportation problem with market choice and related models. Oper. Res. Lett. 42(8): 549-552 (2014) - [i1]Karen I. Aardal, Pierre Le Bodic:
Approximation algorithms for the Transportation Problem with Market Choice and related models. CoRR abs/1410.1409 (2014) - 2013
- [c8]Karen I. Aardal, Frederik von Heymann:
On the Structure of Reduced Kernel Lattice Bases. IPCO 2013: 1-12 - 2012
- [c7]Martin van Buuren, Rob van der Mei, Karen I. Aardal, Henk Post:
Evaluating dynamic dispatch strategies for emergency medical services: TIFAR simulation tool. WSC 2012: 46:1-46:11 - 2010
- [j18]Karen I. Aardal, Laurence A. Wolsey:
Lattice based extended formulations for integer linear equality systems. Math. Program. 121(2): 337-352 (2010) - [j17]Jaroslaw Byrka, Karen I. Aardal:
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. SIAM J. Comput. 39(6): 2212-2231 (2010) - [p1]Karen I. Aardal, Friedrich Eisenbrand:
The LLL Algorithm and Integer Programming. The LLL Algorithm 2010: 293-314
2000 – 2009
- 2008
- [r1]Karen I. Aardal, Jaroslaw Byrka, Mohammad Mahdian:
Facility Location. Encyclopedia of Algorithms 2008 - 2007
- [j16]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster
Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1): 79-129 (2007) - [j15]Jaroslaw Byrka, Karen I. Aardal:
The approximation gap for the metric facility location problem is not yet closed. Oper. Res. Lett. 35(3): 379-384 (2007) - 2004
- [j14]Karen I. Aardal:
Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. J. Comb. Optim. 8(2): 147-149 (2004) - [j13]Karen I. Aardal, Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks. Math. Oper. Res. 29(3): 724-738 (2004) - 2003
- [j12]Karen I. Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster
Models and solution techniques for frequency assignment problems. 4OR 1(4): 261-317 (2003) - [j11]Bram Verweij, Karen I. Aardal:
The merchant subtour problem. Math. Program. 94(2-3): 295-322 (2003) - [j10]Karen I. Aardal, Rekha R. Thomas:
Algebraic and geometric methods in discrete optimization. Math. Program. 96(2): 179-179 (2003) - 2002
- [j9]Karen I. Aardal, Robert Weismantel, Laurence A. Wolsey:
Non-standard approaches to integer programming. Discret. Appl. Math. 123(1-3): 5-74 (2002) - [j8]Karen I. Aardal, Cor A. J. Hurkens, Jan Karel Lenstra, Sergey R. Tiourine:
Algorithms for Radio Link Frequency Assignment: The Calma Project. Oper. Res. 50(6): 968-980 (2002) - [c6]Karen I. Aardal, Arjen K. Lenstra:
Hard Equality Constrained Integer Knapsacks. IPCO 2002: 350-366 - 2001
- [e1]Karen I. Aardal, Bert Gerards:
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Lecture Notes in Computer Science 2081, Springer 2001, ISBN 3-540-42225-0 [contents] - 2000
- [j7]Karen I. 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): 192-202 (2000) - [j6]Karen I. 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): 427-442 (2000) - [c5]Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen
Factorization of a 512-Bit RSA Modulus. EUROCRYPT 2000: 1-18
1990 – 1999
- 1999
- [j5]Karen I. 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): 161-167 (1999) - [c4]Bram Verweij, Karen I. Aardal:
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. ESA 1999: 426-437 - [c3]Karen I. 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: 1-16 - 1998
- [j4]Karen I. Aardal:
Reformulation of capacitated facility location problems: How redundant information can help. Ann. Oper. Res. 82: 289-308 (1998) - [j3]Karen I. Aardal:
Capacitated facility location: Separation algorithms and computational experience. Math. Program. 81: 149-175 (1998) - [c2]Karen I. Aardal, Cor A. J. Hurkens, Arjen K. Lenstra:
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. IPCO 1998: 229-242 - 1997
- [c1]David B. Shmoys
Approximation Algorithms for Facility Location Problems (Extended Abstract). STOC 1997: 265-274 - 1996
- [j2]Karen I. Aardal, Martine Labbé
On the Two-Level Uncapacitated Facility Location Problem. INFORMS J. Comput. 8(3): 289-301 (1996) - 1995
- [j1]Karen I. Aardal, Yves Pochet, Laurence A. Wolsey:
Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20(3): 562-582 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-31 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: