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...

Celý popis

Podrobná bibliografia

Vydané v:	Frontiers in applied mathematics and statistics Ročník 2
Hlavní autori:	Hsieh, Fushing, Fujii, Kevin, Hsieh, Cho-Jui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Frontiers Media S.A 01.11.2016
Predmet:	Assignment problem Data Mechanics netowk mimicking robustness Traveling salesman problem
ISSN:	2297-4687, 2297-4687
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!