Integer programming models and polyhedral study for the geodesic classification problem on graphs
Tài liệu tham khảo
Araújo, 2019, The geodesic classification problem on graphs, Electronic Notes in Theoretical Computer Science, 346, 65, 10.1016/j.entcs.2019.08.007
Araújo, 2019
Aronov, 2012, Minimizing the error of linear separators on linearly inseparable data, Discrete Applied Mathematics, 160, 1441, 10.1016/j.dam.2012.03.009
Artigas, 2011, Partitioning a graph into convex sets, Discrete Mathematics, 311, 1968, 10.1016/j.disc.2011.05.023
Balas, 1989, On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}, Mathematical Programming, 43, 57, 10.1007/BF01582278
Balas, 2005, The vertex separator problem: A polyhedral investigation, Mathematical Programming, 103, 583, 10.1007/s10107-005-0574-7
Bertsimas, 2007, Classification and regression via integer optimization, Operations Research, 55, 252, 10.1287/opre.1060.0360
Blaum, 2019, A set covering approach for the 2-class classification problem
Bondy, 2008
Buzatu, 2015, Convex graph covers, The Computer Science Journal of Moldova, 23, 251
Campêlo, 2008, On the asymmetric representatives formulation for the vertex coloring problem, Discrete Applied Mathematics, 156, 1097, 10.1016/j.dam.2007.05.058
Campêlo, 2015, The convex recoloring problem: Polyhedra, facets and computational experiments, Mathematical Programming, 156
Chopra, 1993, The partition problem, Mathematical Programming, 59, 87, 10.1007/BF01581239
Cornaz, 2019, The multi-terminal vertex separator problem: Polyhedral analysis and branch-and-cut, Discrete Applied Mathematics, 256, 11, 10.1016/j.dam.2018.10.005
Corrêa, 2019, An integer programming approach for the 2-class single-group classification problem, Electronic Notes in Theoretical Computer Science, 346, 321, 10.1016/j.entcs.2019.08.029
Cortes, 1995, Support-vector networks, 273
Crossno, 2013, Topicview: Visual analysis of topic models and their impact on document clustering, International Journal on Artificial Intelligence Tools, 22, 1360008-1, 10.1142/S0218213013600087
Ferreira, 1996, Formulations and valid inequalities for the node capacitated graph partitioning problem, Mathematical Programming, 74, 247, 10.1007/BF02592198
Grötschel, 1990, Facets of the clique partitioning polytope, Mathematical Programming, 47, 367, 10.1007/BF01580870
Hong, 2010, Empirical study of topic modeling in twitter, 80
Karp, 1972, 85
Kurgan, 2001, Knowledge discovery approach to automated cardiac SPECT diagnosis, Artificial Intelligence in Medicine, 23, 149, 10.1016/S0933-3657(01)00082-3
Lima, 2014, Convex recoloring of paths, Discrete Applied Mathematics, 164, 450, 10.1016/j.dam.2013.02.034
Little, 2007, Exploiting nonlinear recurrence and fractal scaling properties for voice disorder detection, BioMedical Engineering OnLine, 6, 23, 10.1186/1475-925X-6-23
Nemhauser, 1988
Pardalos, 2008, vol. 45
Pelayo, 2013
Sánchez-García, 1998, On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}, Annals of Operations Research, 81, 343, 10.1023/A:1018969410431
Xu, 2009, A mixed integer optimisation model for data classification, Computers & Industrial Engineering, 56, 1205, 10.1016/j.cie.2008.07.012
Zaki, 2014