J. Picard

发表

Selected Applications of Minimum Cuts in Networks

J. Picard, M. Queyranne, 1982 .

Maximal Closure of a Graph and Applications to Combinatorial Problems

J. Picard, 1976 .

Minimal Cost Cut Equivalent Networks

H. D. Ratliff, J. Picard, 1973 .

An optimal algorithm for the mixed Chinese postman problem

J. Picard, Y. Nobert, 1996 .

Ranking the Cuts and Cut-Sets of a Network

J. Picard, M. Queyranne, H. Hamacher, 1984 .

On the One-Dimensional Space Allocation Problem

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1981, Oper. Res..

Minimum cuts and related problems

H. D. Ratliff, H. Donald Ratliff, Jean-Claude Picard, 1975, Networks.

A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1982, Networks.

On the structure of all minimum cuts in a network and applications

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1982, Math. Program..

Parametric Maximum Flows And The Calculation Of Optimal Intermediate Contours In Open Pit Mine Design

Benjamin T. Smith, J. Picard, Jean-Claude Picard, 2004 .

An optimal algorithm for the mixed Chinese postman problem

Yves Nobert, Jean-Claude Picard, J. Picard, 1996, Networks.

A Cut Approach to the Rectilinear Distance Facility Location Problem

H. D. Ratliff, H. Donald Ratliff, Jean-Claude Picard, 1978, Oper. Res..

On the integer-valued variables in the linear vertex packing problem

J. C. Picard, M. Queyranne, J. Picard, 1977, Math. Program..

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

Maurice Queyranne, Jean-Claude Picard, J. Picard, 1978, Oper. Res..