 | Monter d'un niveau |
Leblanc, D., & Queyranne, M. (1979). Comparison of alternative methods of updating input-output tables : a note. (Rapport technique n° EP-R-79-21). Disponible
Evrard, P., & Queyranne, M. (1979). Dynamic facility location model: static reduction and application to telephone network planning. (Rapport technique n° EP-R-79-22). Disponible
Picard, J.-C., & Queyranne, M. (1979). Network flow solution of some non linear 0-1 programming problems and applications to graph theory. (Rapport technique n° EP-R-79-14). Disponible
Picard, J.-C., & Queyranne, M. (1979). On the structure of all minimum cuts in a network and applications. (Rapport technique n° EP-R-79-15). Disponible
Picard, J.-C., & Queyranne, M. (1979). Selected applications of maximum flows and minimum cuts in networks. (Rapport technique n° EP-R-79-35). Disponible
Picard, J.-C., & Queyranne, M. (1978). On the one-dimensional space allocation problem. (Rapport technique n° EP-R-78-48). Disponible
Queyranne, M. (1978). Theoretical efficiency of the algorithm "capacity" for the maximum flow problem. (Rapport technique n° EP-R-78-43). Disponible
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. (Rapport technique n° EP-R-78-28). Disponible
Queyranne, M. (1977). Anneaux achevés d'ensembles et préordrés. (Rapport technique n° EP-R-77-14). Disponible
Queyranne, M. (1977). Equivalence of two primal methods for the assignment problem. (Rapport technique n° EP-R-77-15). Disponible
Picard, J.-C., & Queyranne, M. (1977). Time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. (Rapport technique n° EP-R-77-12). Disponible
Picard, J.-C., & Queyranne, M. (1976). Exact algorithms for the quadratic assignment problem. (Rapport technique n° EP-R-76-17). Disponible
Picard, J.-C., & Queyranne, M. (1976). Problème du voyageur de commerce : plus court chemin et optimisation par sous-gradient. (Rapport technique n° EP-R-76-07). Disponible
Picard, J.-C., & Queyranne, M. (1976). Time-dependent traveling salesman problem and application to the tardiness problem in one-machine scheduling. (Rapport technique n° EP-R-76-14). Disponible
Picard, J.-C., & Queyranne, M. (1975). On the integer-valued variables in the linear vertex packing problem. (Rapport technique n° EP-R-75-35). Disponible
Picard, J.-C., & Queyranne, M. (1975). Problème du voyageur de commerce : une formulation par programmation linéaire. (Rapport technique n° EP-R-75-07). Disponible
Picard, J.-C., & Queyranne, M. (1975). Simple validation of maximum closure of a graph. (Rapport technique n° EP-R-75-60). Disponible
Picard, J.-C., & Queyranne, M. (1975). Vertex packings : (VLP)-reductions through alternate labelling. (Rapport technique n° EP-R-75-47). Disponible
