#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1995

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David B. Shmoys, Éva Tardos, Karen Aardal
- STOC
- 1997

Approximationalgorithmsfor facilitylocationproblems

- Karen Aardal, Stan P. M. van Hoesel, Arie M. C. A. Koster, Carlo Mannino, Antonio Sassano
- Annals OR
- 2003

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the… (More)

- Karen Aardal, Arjen K. Lenstra
- IPCO
- 2002

We consider the following integer feasibility problem: Given positive integer numbers a0 a1 an, with gcd a1 an = 1 and a = a1 an , does there exist a vector x ∈ n≥0 satisfying a x = a0? We prove that if the coefficients a1 an have a certain decomposable structure, then the Frobenius number associated with a1 an, i.e., the largest value of a0 for which a x=… (More)

- Karen Aardal
- Math. Program.
- 1998

We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single depot, and combinatorial inequalities. The ow cover, e ective capacity, and single depot inequalities form subfamilies of the general family of submodular inequalities. The… (More)

- Karen Aardal, Fabián A. Chudak, David B. Shmoys
- Inf. Process. Lett.
- 1999

In the k-level uncapacitated facility location problem, we have a set of demand points where clients are located. The demand of each client is known. Facilities have to be located at given sites in order to service the clients, and each client is to be serviced by a sequence of k different facilities, each of which belongs to a distinct level. There are no… (More)

- Karen Aardal, Yves Pochet, Laurence A. Wolsey
- Math. Oper. Res.
- 1995

- Karen Aardal, Robert Weismantel, Laurence A. Wolsey
- Discrete Applied Mathematics
- 2002

In this survey we address three of the principal algebraic approaches to integer programming. After introducing lattices and basis reduction, we 0rst survey their use in integer programming, presenting among others Lenstra’s algorithm that is polynomial in 0xed dimension, and the solution of diophanine equations using basis reduction. The second topic… (More)

- Karen Aardal, Cor A. J. Hurkens, Arjen K. Lenstra
- Math. Oper. Res.
- 2000

- Stefania Cavallar, Bruce Dodson, +14 authors Paul Zimmermann
- EUROCRYPT
- 2000

On August we completed the factorization of the bit digit number RSA with the help of the Number Field Sieve factoring method NFS This is a new record for factoring general numbers Moreover bit RSA keys are frequently used for the protection of electronic commerce at least outside the USA so this factorization represents a breakthrough in research on RSA… (More)

- Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne
- INFORMS Journal on Computing
- 1996

We study the two-level uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call y-facilities and z-facilities, the problem is to decide which facilities of both types to open, and to which pair of yand z-facilities each client should be assigned, in order to satisfy the demand at maximum profit. We first present two… (More)