2008 |
25 | EE | Jan Adem,
Yves Crama,
Willy Gochet,
Frits C. R. Spieksma:
Counting and enumerating aggregate classifiers.
Discrete Applied Mathematics 156(13): 2459-2468 (2008) |
2007 |
24 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter L. Hammer (1936-2006).
4OR 5(1): 1-4 (2007) |
23 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer.
Discrete Mathematics 307(17-18): 2153-2155 (2007) |
22 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
Discrete Optimization 4(3-4): 257-259 (2007) |
21 | EE | Yves Crama,
Luc Leruth:
Control and voting power in corporate networks: Concepts and computational aspects.
European Journal of Operational Research 178(3): 879-893 (2007) |
20 | EE | Yves Crama,
Linda S. Moonen,
Frits C. R. Spieksma,
Ellen Talloen:
The tool switching problem revisited.
European Journal of Operational Research 182(2): 952-957 (2007) |
19 | EE | Endre Boros,
Yves Crama,
Bruno Simeone:
Peter Ladislaw Hammer: December 23, 1936-December 27, 2006.
J. Heuristics 13(2): 95-98 (2007) |
2005 |
18 | EE | Nadia Brauner,
Yves Crama,
Alexander Grigoriev,
Joris van de Klundert:
A Framework for the Complexity of High-Multiplicity Scheduling Problems.
J. Comb. Optim. 9(3): 313-323 (2005) |
2004 |
17 | EE | Nadia Brauner,
Yves Crama:
The maximum deviation just-in-time scheduling problem.
Discrete Applied Mathematics 134(1-3): 25-50 (2004) |
16 | EE | Gabriela Alexe,
Sorin Alexe,
Yves Crama,
Stephan Foldes,
Peter L. Hammer,
Bruno Simeone:
Consensus algorithms for the generation of all maximal bicliques.
Discrete Applied Mathematics 145(1): 11-21 (2004) |
15 | EE | Yves Crama,
R. Pascual J.,
A. Torres:
Optimal procurement decisions in the presence of total quantity discounts and alternative product recipes.
European Journal of Operational Research 159(2): 364-378 (2004) |
2002 |
14 | | Yves Crama,
Joris van de Klundert,
Frits C. R. Spieksma:
Production planning problems in printed circuit board assembly.
Discrete Applied Mathematics 123(1-3): 339-361 (2002) |
2000 |
13 | EE | Endre Boros,
Yves Crama,
Oya Ekin,
Peter L. Hammer,
Toshihide Ibaraki,
Alexander Kogan:
Boolean Normal Forms, Shellability, and Reliability Computations.
SIAM J. Discrete Math. 13(2): 212-226 (2000) |
1997 |
12 | EE | Yves Crama,
Oya Ekin,
Peter L. Hammer:
Variable and Term Removal From Boolean Formulae.
Discrete Applied Mathematics 75(3): 217-230 (1997) |
11 | EE | Yves Crama,
Maarten Oosten:
The polytope of block diagonal matrices and complete bipartite partitionings.
Networks 30(4): 263-282 (1997) |
1996 |
10 | | Yves Crama,
Frits C. R. Spieksma:
Scheduling jobs of equal length: compleixty, facets and computational results.
Math. Program. 72: 207-227 (1996) |
1995 |
9 | | Yves Crama,
Antoon W. J. Kolen,
Erwin Pesch:
Local Search in Combinatorial Optimization.
Artificial Neural Networks 1995: 157-174 |
8 | | Yves Crama,
Frits C. R. Spieksma:
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results.
IPCO 1995: 277-291 |
1994 |
7 | | Hans-Jürgen Bandelt,
Yves Crama,
Frits C. R. Spieksma:
Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
Discrete Applied Mathematics 49(1-3): 25-50 (1994) |
6 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
SIAM J. Comput. 23(1): 45-49 (1994) |
1993 |
5 | | Yves Crama:
Concave extensions for nonlinear 0-1 maximization problems.
Math. Program. 61: 53-60 (1993) |
1992 |
4 | | Endre Boros,
Yves Crama,
Peter L. Hammer,
Michael E. Saks:
A Complexity Index for Satisfiability Problems.
IPCO 1992: 220-226 |
3 | | Endre Boros,
Yves Crama,
Peter L. Hammer:
Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization.
SIAM J. Discrete Math. 5(2): 163-177 (1992) |
1990 |
2 | | Endre Boros,
Yves Crama,
Peter L. Hammer:
Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae.
Ann. Math. Artif. Intell. 1: 21-32 (1990) |
1 | EE | Yves Crama,
Pierre Hansen,
Brigitte Jaumard:
The basic algorithm for pseudo-Boolean programming revisited.
Discrete Applied Mathematics 29(2-3): 171-185 (1990) |