Smith, THC; Meyer, TWS; Leenen, L
(South African Institute of Computer Scientists and Information Technologists, 1991)
The continuous 2-matching problem {RMP2) is the relaxation of the symmetric travelling salesman problem {STSP) used by Padberg & Rinaldi to develop a highly successful branch-and-cut algorithm for the STSP. ...