Machine Learning Meliorates Computing and Robustness in Discrete Combinatorial Optimization Problems

Discrete combinatorial optimization problems in real world are typically defined via an ensemble of potentially high dimensional measurements pertaining to all subjects of a system under study. We point out that such a data ensemble in fact embeds with system's information content that is not d...

Full description

Bibliographic Details

Published in:	Frontiers in applied mathematics and statistics Vol. 2
Main Authors:	Hsieh, Fushing, Fujii, Kevin, Hsieh, Cho-Jui
Format:	Journal Article
Language:	English
Published:	Frontiers Media S.A 01.11.2016
Subjects:	Assignment problem Data Mechanics netowk mimicking robustness Traveling salesman problem
ISSN:	2297-4687, 2297-4687
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!