A new bound for the ratio between the 2-matching problem and its linear programming relaxation
type: Item
instance of: scholarly article
title: A new bound for the ratio between the 2-matching problem and its linear programming relaxation
zbMATH Open document ID: 0946.90067
author: Yanyan Li
published in: Mathematical Programming. Series A. Series B
publication date: 2000-06-22T00:00:00Z
full work available at URL: https://www.osti.gov/biblio/9490
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1419750
zbMATH Keywords: 2-matching
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: subtour elimination problem
zbMATH Keywords: polyhedral combinatorics
MaRDI profile type: Publication
OpenAlex ID: W4229642423
DOI: 10.1007/S101070050102
description: scientific article; zbMATH DE number 1419750