The following pages link to Jean-Claude Picard (Q792222):
Displaying 18 items.
- On finding the K best cuts in a network (Q792224) (← links)
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (Q1146121) (← links)
- (Q3356328) (← links)
- (Q3683848) (← links)
- (Q3793964) (← links)
- On the structure of all minimum cuts in a network and applications (Q3885550) (← links)
- A cut approach to a class of quadratic integer programming problems (Q3899822) (← links)
- On the One-Dimensional Space Allocation Problem (Q3929539) (← links)
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (Q3945965) (← links)
- Selected Applications of Minimum Cuts in Networks (Q3967364) (← links)
- Minimal Cost Cut Equivalent Networks (Q4079341) (← links)
- Minimum cuts and related problems (Q4090127) (← links)
- Maximal Closure of a Graph and Applications to Combinatorial Problems (Q4108358) (← links)
- On the integer-valued variables in the linear vertex packing problem (Q4136929) (← links)
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling (Q4147830) (← links)
- A Cut Approach to the Rectilinear Distance Facility Location Problem (Q4161098) (← links)
- An optimal algorithm for the mixed Chinese postman problem (Q4887738) (← links)
- A Graph-Theoretic Equivalence for Integer Programs (Q5679925) (← links)
