Jean-Claude Picard

Networks, 1996

1982

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

[BibT_eX]

[DOI]

Networks, 1982

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

[BibT_eX]

[DOI]

Math. Program., 1982

1981

On the One-Dimensional Space Allocation Problem.

[BibT_eX]

[DOI]

Oper. Res., 1981

1980

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

[BibT_eX]

[DOI]

Networks, 1980

1978

A Cut Approach to the Rectilinear Distance Facility Location Problem.

[BibT_eX]

[DOI]

Oper. Res., 1978

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

[BibT_eX]

[DOI]

Oper. Res., 1978

1977

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

[BibT_eX]

[DOI]

Math. Program., 1977

1975

Minimum cuts and related problems.

[BibT_eX]

[DOI]

Networks, 1975

1973

A Graph-Theoretic Equivalence for Integer Programs.

[BibT_eX]

[DOI]