jean-marie bourjolly
TitleCited byYear
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
1362001
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
1091995
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
922002
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
751992
Heuristics for finding k-clubs in an undirected graph
JM Bourjolly, G Laporte, G Pesant
Computers & Operations Research 27 (6), 559-569, 2000
612000
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
JM Bourjolly, WR Pulleyblank
Discrete Applied Mathematics 24 (1-3), 63-82, 1989
541989
Node-weighted graphs having the König-Egervary property
JM Bourjolly, PL Hammer, B Simeone
Mathematical Programming at Oberwolfach II, 44-63, 1984
361984
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
321981
An analysis of lower bound procedures for the bin packing problem
JM Bourjolly, V Rebetez
Computers & operations research 32 (3), 395-405, 2005
262005
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
191997
An exact quadratic 0-1 algorithm for the stable set problem
JM Bourjolly
Cliques, Coloring, and Satisflability, 1996
141996
Boolean-combinatorial bounding of maximum 2-satisfiability
JM Bourjolly, PL Hammer, WR Pulleyblank, B Simeone
Computer Science and Operations Research, 23-42, 1992
101992
Integral and fractional node-packings, and pseudo-Boolean programming.
PJ BOURJOLLY
101987
Optimizing frequency hopping in GSM cellular phone networks
JM Bourjolly, S Touhami, L Déjoie, K Ding, O Dioume, M Lominy
Telecommunication Systems 21 (2-4), 249-260, 2002
92002
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
91994
Combinatorial methods for bounding quadratic pseudo-Boolean functions
JM Bourjolly, ...
Faculty of Mathematics, University of Waterloo, 1989
91989
An extension of the König-Egerváry property to node-weighted bidirected graphs
JM Bourjolly
Mathematical programming 41 (1-3), 375-384, 1988
71988
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
71984
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
71984
A combinatorial column generation algorithm for the maximum clique and stable set problems
JM Bourjolly, G Laporte, H Mercure
Cahiers du GERAD, 1994
51994
The system can't perform the operation now. Try again later.
Articles 1–20