A Graph-Theoretic Equivalence for Integer Programs. - Jean-Claude Picard; H. Donald Ratliff (Oper. Res., 1973)

Minimum cuts and related problems. - Jean-Claude Picard; H. Donald Ratliff (Networks, 1975)

On the integer-valued variables in the linear vertex packing problem. - Jean-Claude Picard; Maurice Queyranne (Math. Program., 1977)

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling. - Jean-Claude Picard; Maurice Queyranne (Oper. Res., 1978)

A Cut Approach to the Rectilinear Distance Facility Location Problem. - Jean-Claude Picard; H. Donald Ratliff (Oper. Res., 1978)

A cut approach to a class of quadratic integer programming problems. - Jean-Claude Picard; H. Donald Ratliff (Networks, 1980)

On the One-Dimensional Space Allocation Problem. - Jean-Claude Picard; Maurice Queyranne (Oper. Res., 1981)

On the structure of all minimum cuts in a network and applications. - Jean-Claude Picard; Maurice Queyranne (Math. Program., 1982)

A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. - Jean-Claude Picard; Maurice Queyranne (Networks, 1982)

An optimal algorithm for the mixed Chinese postman problem. - Yves Nobert; Jean-Claude Picard (Networks, 1996)