2020
DOI: 10.48550/arxiv.2005.05847
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems

Yuan Sun,
Andreas Ernst,
Xiaodong Li
et al.

Abstract: Combinatorial optimization plays an important role in real-world problem solving. In the big data era, the dimensionality of a combinatorial optimization problem is usually very large, which poses a significant challenge to existing solution methods. In this paper, we examine the generalization capability of a machine learning model for problem reduction on the classic traveling salesman problems (TSP). We demonstrate that our method can greedily remove decision variables from an optimization problem that are … Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 25 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?