Parallel branch and cut and its application to the traveling salesman problem

Authors:
Laszlo Ladanyi
Affiliations:
Cornell Univ.
Venue:
Parallel branch and cut and its application to the traveling salesman problem
Year:
1996

Citing 0
Cited 1

Branch, Cut, and Price: Sequential and Parallel

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

Quantified Score

Hi-index	0.00

Visualization

Abstract