A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover M Gopalakrishnan, K Ding, JM Bourjolly, S Mohan Management science 47 (6), 851-863, 2001 | 159 | 2001 |
An exact algorithm for the maximum k-club problem in an undirected graph JM Bourjolly, G Laporte, G Pesant European Journal of Operational Research 138 (1), 21-28, 2002 | 124 | 2002 |
Topological design of computer communication networks using simulated annealing S Pierre, MA Hyppolite, JM Bourjolly, O Dioume Engineering Applications of Artificial Intelligence 8 (1), 61-69, 1995 | 112 | 1995 |
Branch-and-bound algorithms for the multi-product assembly line balancing problem I Berger, JM Bourjolly, G Laporte European Journal of Operational Research 58 (2), 215-222, 1992 | 89 | 1992 |
Heuristics for finding k-clubs in an undirected graph JM Bourjolly, G Laporte, G Pesant Computers & Operations Research 27 (6), 559-569, 2000 | 84 | 2000 |
König-Egerváry graphs, 2-bicritical graphs and fractional matchings JM Bourjolly, WR Pulleyblank Discrete Applied Mathematics 24 (1-3), 63-82, 1989 | 66 | 1989 |
Bithreshold graphs PL Hammer, NVR Mahadev SIAM Journal on Algebraic Discrete Methods 6 (3), 497-506, 1985 | 41 | 1985 |
Node-weighted graphs having the König-Egervary property JM Bourjolly, PL Hammer, B Simeone Mathematical Programming at Oberwolfach II, 44-63, 1984 | 41 | 1984 |
Decoupage electoral automatise: Application a l’lle de montreal JM Bourjolly, G Laporte, JM Rousseau INFOR: Information Systems and Operational Research 19 (2), 113-124, 1981 | 35 | 1981 |
An analysis of lower bound procedures for the bin packing problem JM Bourjolly, V Rebetez Computers & operations research 32 (3), 395-405, 2005 | 29 | 2005 |
A combinatorial column generation algorithm for the maximum stable set problem JM Bourjolly, G Laporte, H Mercure Operations research letters 20 (1), 21-29, 1997 | 23 | 1997 |
Operational Research: methods and applications F Petropoulos, G Laporte, E Aktas, SA Alumur, C Archetti, H Ayhan, ... Journal of the Operational Research Society 75 (3), 423-617, 2024 | 22 | 2024 |
Refonder Haïti? P Buteau, R Saint-Éloi, L Trouillot, M Acacia, L Auguste, F Bolivar, ... Mémoire d'Encrier, 2010 | 16 | 2010 |
An exact quadratic 0-1 algorithm for the stable set problem JM Bourjolly, P Gill, G Laporte, H Mercure DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, 53-73, 1996 | 14 | 1996 |
Haïti: quellereconstruction? JM Bourjolly Buteau, Pierre; Saint-Éloi, Rodney; Trouillot Lyonel (eds.) Refonder Haiti …, 2010 | 13 | 2010 |
Boolean-combinatorial bounding of maximum 2-satisfiability JM Bourjolly, PL Hammer, WR Pulleyblank, B Simeone Computer Science and Operations Research, 23-42, 1992 | 13 | 1992 |
Optimizing frequency hopping in GSM cellular phone networks JM Bourjolly, S Touhami, L Déjoie, K Ding, O Dioume, M Lominy Telecommunication systems 21, 249-260, 2002 | 11 | 2002 |
Integral and fractional node-packings, and pseudo-Boolean programming. PJ BOURJOLLY | 10 | 1987 |
A quadratic 0-1 optimization algorithm for the maximum clique and stable set problems JM Bourjolly Univ. of Michigan, Ann Arbor, MI (United States), 1994 | 9 | 1994 |
Some further results on k-star constraints and comb inequalities G Laporte, JM Bourjolly Université de Montréal, Centre de recherche sur les transports, 1984 | 9 | 1984 |