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...
Main Authors: | Fushing Hsieh, Kevin Fujii, Cho-Jui Hsieh |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2016-11-01
|
Series: | Frontiers in Applied Mathematics and Statistics |
Subjects: | |
Online Access: | http://journal.frontiersin.org/Journal/10.3389/fams.2016.00020/full |
Similar Items
-
The traveling salesman problem : a computational study /
by: Applegate, David L.
Published: (2007) -
Solving travelling salesman problem using nios processor /
by: 560514 Shaikh Nasir Shaikh Husin, et al.
Published: (2007) -
Solving traveling salesman problem using Nios processor /
by: 461278 Lim, Kai Lin
Published: (2006) -
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm /
by: 196939 Amir Atapour Abarghouei, et al.
Published: (2010) -
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm [electronic resource] /
by: 196939 Amir Atapour Abarghouei, et al.
Published: (2010)