 | 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.
Gendreau, M., Picard, J.-C., & Zubieta, L. (1988). An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem. In Advances in Optimization and Control (Vol. 302, pp. 79-91). External link
Houck, D. J. J., Picard, J.-C., Queyranne, M., & Vemuganti, R. R. (1978). Traveling salesman problem as a constrained shortest path problem: theory and computational experience. (Technical Report n° EP-R-78-28). Available
Picard, J.-C., & Queyranne, M. (1979). Network flow solution of some non linear 0-1 programming problems and applications to graph theory. (Technical Report n° EP-R-79-14). Available
Picard, J.-C., & Queyranne, M. (1979). On the structure of all minimum cuts in a network and applications. (Technical Report n° EP-R-79-15). Available
Picard, J.-C., & Queyranne, M. (1979). Selected applications of maximum flows and minimum cuts in networks. (Technical Report n° EP-R-79-35). Available
Picard, J.-C., & Ratliff, H. D. (1978). A Cut Approach to the Rectilinear Distance Facility Location Problem. Operations Research, 26(3), 422-433. External link
Picard, J.-C., & Queyranne, M. (1978). The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. Operations Research, 26(1), 86-110. External link
Picard, J.-C., & Queyranne, M. (1978). On the one-dimensional space allocation problem. (Technical Report n° EP-R-78-48). Available
Picard, J.-C., & Queyranne, M. (1977). On the integer-valued variables in the linear vertex packing problem. Mathematical Programming, 12(1), 97-101. External link
Picard, J.-C., & Queyranne, M. (1977). Time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. (Technical Report n° EP-R-77-12). Available
Picard, J.-C. (1976). Maximal Closure of a Graph and Applications to Combinatorial Problems. Management Science, 22(11), 1268-1272. External link
Picard, J.-C., & Queyranne, M. (1976). Exact algorithms for the quadratic assignment problem. (Technical Report n° EP-R-76-17). Available
Picard, J.-C., & Queyranne, M. (1976). Problème du voyageur de commerce : plus court chemin et optimisation par sous-gradient. (Technical Report n° EP-R-76-07). Available
Picard, J.-C., & Queyranne, M. (1976). Time-dependent traveling salesman problem and application to the tardiness problem in one-machine scheduling. (Technical Report n° EP-R-76-14). Available
Picard, J.-C., & Queyranne, M. (1975). On the integer-valued variables in the linear vertex packing problem. (Technical Report n° EP-R-75-35). Available
Picard, J.-C., & Queyranne, M. (1975). Problème du voyageur de commerce : une formulation par programmation linéaire. (Technical Report n° EP-R-75-07). Available
Picard, J.-C., & Queyranne, M. (1975). Simple validation of maximum closure of a graph. (Technical Report n° EP-R-75-60). Available
Picard, J.-C., & Queyranne, M. (1975). Vertex packings : (VLP)-reductions through alternate labelling. (Technical Report n° EP-R-75-47). Available
Picard, J.-C. (1974). Maximal closure of graph. (Technical Report n° EP-R-74-02). Restricted access
Picard, J.-C., & Ratliff, H. D. (1974). Minimum cuts and related problems. (Technical Report n° EP-R-74-18). Restricted access
Picard, J.-C., & Ratliff, H. D. (1973). Minimal Cost Cut Equivalent Networks. Management Science, 19(9), 1087-1092. External link
Picard, J.-C., & Donald Ratliff, H. (1973). A Graph-Theoretic Equivalence for Integer Programs. Operations Research, 21(1), 261-269. External link
Picard, J.-C. (1973). Planification de l'exploitation d'un gisement minier. (Technical Report n° EP-R-73-36). Restricted access
Picard, J.-C., & Smith, B. T. (1973). Search for alternative fronts in an open pit mine. (Technical Report n° EP-R-73-37). Restricted access
