Karen Aardal

According to our database1, Karen Aardal authored at least 31 papers between 1995 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Facility Location.
Encyclopedia of Algorithms, 2016

A constructive proof of Swap Local Search worst-case instances for the Maximum Coverage Problem.
Oper. Res. Lett., 2016

2015
Time-dependent MEXCLP with start-up and relocation cost.
Eur. J. Oper. Res., 2015

Approximation algorithms for hard capacitated k-facility location problems.
Eur. J. Oper. Res., 2015

2014
Approximation algorithms for the transportation problem with market choice and related models.
Oper. Res. Lett., 2014

On the Structure of Reduced Kernel Lattice Bases.
Math. Oper. Res., 2014

2012
Evaluating dynamic dispatch strategies for emergency medical services: TIFAR simulation tool.
Proceedings of the Winter Simulation Conference, 2012

2010
The LLL Algorithm and Integer Programming.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.
SIAM J. Comput., 2010

Lattice based extended formulations for integer linear equality systems.
Math. Program., 2010

2008
Facility Location.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
The approximation gap for the metric facility location problem is not yet closed.
Oper. Res. Lett., 2007

Models and solution techniques for frequency assignment problems.
Annals OR, 2007

2004
Hard Equality Constrained Integer Knapsacks.
Math. Oper. Res., 2004

Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration.
J. Comb. Optim., 2004

2003
The merchant subtour problem.
Math. Program., 2003

Algebraic and geometric methods in discrete optimization.
Math. Program., 2003

2002
Algorithms for Radio Link Frequency Assignment: The Calma Project.
Operations Research, 2002

Non-standard approaches to integer programming.
Discret. Appl. Math., 2002

2000
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables.
Math. Oper. Res., 2000

Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances.
INFORMS Journal on Computing, 2000


1999
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem.
Inf. Process. Lett., 1999

Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling.
Proceedings of the Algorithms, 1999

1998
Capacitated facility location: Separation algorithms and computational experience.
Math. Program., 1998

Reformulation of capacitated facility location problems: How redundant information can help.
Annals OR, 1998

Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Approximation Algorithms for Facility Location Problems (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
On the Two-Level Uncapacitated Facility Location Problem.
INFORMS Journal on Computing, 1996

1995
Capacitated Facility Location: Valid Inequalities and Facets.
Math. Oper. Res., 1995


  Loading...