In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
[13] D. Bezanovic, C.J. van Duijn, and E.F. Kaasschieter. Analysis of wet pressing of pape... (2008)
K. Aardal, C. Mannino, A. Sassano Models, C. Baier, ...
Note that many of these publications are available electronically at
Quentin Louveaux, K. Aardal, B. Fortz, Y. Nesterov, ...
There are many people I would like to thank who helped me achieve this longterm work. First of all, I would like to thank my supervisor Laurence Wolsey. He has always been remarkably open and...
Market split and basis reduction: Towards a solution of the Cornuejols-Dawande instances (1999)
K. Aardal, R. E. Bixby, A. K. Lenstra, J. W. Smeltink
At the IPCO VI conference Cornuejols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear...
Market Split and Basis Reduction: Towards a Solution of the Cornuejols-Dawande Instances (1999)
Aardal Bixby Hurkens, K. Aardal, K. Aardal, R. E. Bixby, R. E. Bixby, ...
At the IPCO VI conference Cornuejols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear...
Polyhedral Techniques in Combinatorial Optimization (1995)
Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are compu- tationally hard due to the...
Capacitated facility location: separation algorithms and computational experience (1995)
We consider the polyhedral approach to solving the capacitated facility location prob- lem. The valid inequalities considered are the knapsack, ow cover, eective capacity, single depot, and...
Polyhredral techniques in combinatorial optimization I: theory (1995)
Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulate...
Capacitated Facility Location: Separation Algorithms and Computational Experience (1994)
Capacitated Facility Location: Separation Algorithms and Computational Experience
Capacitated Facility Location: Separation Algorithms and Computational Experience (1994)
Capacitated Facility Location: Separation Algorithms and Computational Experience
Polyhedral Techniques in Combinatorial Optimization
Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are compu- tationally hard due to the...
Capacitated Facility Location: Separation Algorithms and Computational Experience.
econometrics ; data
On the Two-Level Uncapacitated Facility Location Problem.
Aardal, K., Labbe, M., Leung, J., Queyranne, M.
economic models ; econometrics
Non-Standard Approaches to Integer Programming.
Aardal, K., Weismantel, R., Wosley, L.
In this survey we address three of the principle algebraic approaches to integer programming. After introducing lattices and basis reduction, we first survey their use in integer programming,...