 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Fischer, V., Pacheco Paneque, M., Legrain, A., & Bürgy, R. (2021). A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection. (Technical Report n° G-2021-73). External link
Bürgy, R., Hertz, A., & Baptiste, P. (2020). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Computers & Operations Research, 124, 24 pages. External link
Bürgy, R., Baptiste, P., & Hertz, A. (2019). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. (Technical Report n° G-2017-82). External link
Attia, D., Bürgy, R., Desaulniers, G., & Soumis, F. (2019). A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. (Technical Report n° G-2019-13). External link
Attia, D., Bürgy, R., Desaulniers, G., & Soumis, F. (2019). A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. EURO Journal on Computational Optimization, 7(4), 325-357. External link
Bürgy, R., Michon-Lacaze, H., & Desaulniers, G. (2019). Employee scheduling with short demand perturbations and extensible shifts. Omega-International Journal of Management Science, 89, 177-192. External link
Bürgy, R., Michon-Lacaze, H., & Desaulniers, G. (2018). Employee scheduling with short demand perturbations and extensible shifts. (Technical Report n° G-2018-18). External link
Bürgy, R., & Bulbul, K. (2018). The job shop scheduling problem with convex costs. European Journal of Operational Research, 268(1), 82-100. External link
Bürgy, R., Baptiste, P., Hertz, A., Rebaine, D., & Linhares, A. (2018). A stochastic online algorithm for unloading boxes from a conveyor line. Flexible Services and Manufacturing Journal, 30(4), 764-784. External link
Bürgy, R., & Bülbül, K. (2017). The job shop scheduling problem with convex costs. (Technical Report n° G-2017-54). External link
Bürgy, R. (2017). A neighborhood for complex job shop scheduling problems with regular objectives. Journal of Scheduling, 20(4), 391-422. External link
Baptiste, P., Bürgy, R., Hertz, A., & Rebaïne, D. (2017). Online heuristics for unloading boxes off a gravity conveyor. International Journal of Production Research, 55(11), 3046-3057. External link
Bürgy, R., & Gröflin, H. (2016). The no-wait job shop with regular objective: a method based on optimal job insertion. Journal of Combinatorial Optimization, 33(3), 977-1010. External link
