Jean-Claude Picard

According to our database1, Jean-Claude Picard authored at least 10 papers between 1973 and 1996.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1996
An optimal algorithm for the mixed Chinese postman problem.
Networks, 1996

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

On the structure of all minimum cuts in a network and applications.
Math. Program., 1982

1981
On the One-Dimensional Space Allocation Problem.
Oper. Res., 1981

1980
A cut approach to a class of quadratic integer programming problems.
Networks, 1980

1978
A Cut Approach to the Rectilinear Distance Facility Location Problem.
Oper. Res., 1978

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling.
Oper. Res., 1978

1977
On the integer-valued variables in the linear vertex packing problem.
Math. Program., 1977

1975
Minimum cuts and related problems.
Networks, 1975

1973
A Graph-Theoretic Equivalence for Integer Programs.
Oper. Res., 1973


  Loading...