Bourjolly Jean-Marie

Jean-Marie Bourjolly

Information about the author Jean-Marie Bourjolly will soon be added to the site.
Found 10 papers in total
Optimizing hopping sequences for reducing interference in frequency hopping cellular networks
Optimizing hopping sequences for reducing interference in frequency hopping cellular networks
2010
Frequency hopping is a feature in GSM (Global System for Mobile Communications)...
Antenna positioning in mobile telecommunication networks
Antenna positioning in mobile telecommunication networks
2006
This paper examines the Antenna Positioning Problem in cellular networks, involving...
On-orbit servicing: a time-dependent, moving-target traveling salesman problem
On-orbit servicing: a time-dependent, moving-target traveling salesman problem
2006
The robotic capability of maintaining and repairing space assets, on-orbit servicing...
An analysis of lower bound procedures for the bin packing problem
An analysis of lower bound procedures for the bin packing problem
2005
In this paper, we review LB2 and LB3 , two lower bounds for the bin packing problem...
A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
2001
This paper presents a tabu-search heuristic for the capacitated lot-sizing problem...
An exact algorithm for the maximum k-club problem in an undirected graph
An exact algorithm for the maximum k-club problem in an undirected graph
2002
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
Heuristics for finding k-clubs in an undirected graph
Heuristics for finding k-clubs in an undirected graph
2000
In a graph G , a k -club is a vertex set inducing a subgraph of diameter k . These...
Using simulated annealing to minimize the cost of centralized telecommunications networks
Using simulated annealing to minimize the cost of centralized telecommunications networks
1999
The network design problems studied in this paper are typically known in the...
A combinatorial column generation algorithm for the maximum stable set problem
A combinatorial column generation algorithm for the maximum stable set problem
1997
In this paper, we derive lower bounds on the size of a minimum cover of a graph G by...
Branch-and-bound algorithms for the multi-product assembly line balancing problem
Branch-and-bound algorithms for the multi-product assembly line balancing problem
1992
This paper considers a flexible manufacturing system for several products, each...
Papers per page: