Open AccessA new bound for the ratio between the 2-matching problem and its linear programming relaxation
Author(s) -
Sylvia Boyd,
Robert D. Carr
Publication year - 1999
Publication title -
mathematical programming
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.358
H-Index - 131
eISSN - 1436-4646
pISSN - 0025-5610
DOI - 10.1007/s101070050102
Subject(s) - linear programming relaxation , linear programming , travelling salesman problem , mathematics , relaxation (psychology) , bounded function , matching (statistics) , combinatorics , conjecture , mathematical optimization , value (mathematics) , triangle inequality , discrete mathematics , mathematical analysis , statistics , psychology , social psychology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom