{"id":1276,"date":"2013-01-29T20:01:43","date_gmt":"2013-01-29T20:01:43","guid":{"rendered":"https:\/\/www.ise.ufl.edu\/cao\/?page_id=1276"},"modified":"2025-03-14T10:42:09","modified_gmt":"2025-03-14T15:42:09","slug":"selected-publications","status":"publish","type":"page","link":"https:\/\/ise.ufl.edu\/cao\/boris-goldengorin\/selected-publications\/","title":{"rendered":"Selected Publications"},"content":{"rendered":"

Home<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CV<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Research Interests<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Publications<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Conference talks<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Teaching<\/a>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Contact Information<\/a><\/p>\n

Books<\/strong><\/p>\n

B.\u00a0Goldengorin, V.A. Kalyagin, P.M. Pardalos (Eds.) Models, Algorithms,\u00a0and Technologies for Network Analysis. Proceedings of the Second International\u00a0Conference on Network Analysis. Springer Proceedings in Mathematics\u00a0& Statistics, Vol. 59, 2013, 204 http:\/\/www.springer.com\/mathematics\/book\/978-1-4614-8587-2<\/a><\/p>\n

B.\u00a0Goldengorin, D. Krushinsky, P. M. Pardalos. Cell Formation in Industrial\u00a0Engineering: Theory, Algorithms and Experiments. Springer, USA,\u00a0<\/em>2013, 218 pp. ISBN: ISBN 978-1-4614-8001-3\u00a0<\/em><\/em>http:\/\/www.springer.com\/mathematics\/computational+science+<\/a><\/em><\/em><\/em><\/p>\n

Models, Algorithms, and Technologies for Network Analysis<\/a> \/ Ed. by B. Goldengorin, V.A. Kalyagin <\/a>, P.M. Pardalos<\/a>. 32, <\/strong>Springer, New York, 2013.<\/p>\n

Goldengorin B., Pardalos P.M.<\/a> Data Correcting Approaches in Combinatorial Optimization<\/a>. Springer, New York, 2012, 116 pp.<\/p>\n

B. Goldengorin. Requirements of Standards: Optimization Models and Algorithms, Russian Operations Research Co., Hoogezand, The Netherlands, 1995, 219 pp.<\/div>\n

Papers<\/strong><\/p>\n

2013<\/strong><\/div>\n
B. Goldengorin, A. Kocheturov, and P.M. Pardalos.
\nA Pseudo-Boolean Approach to the Market Graph Analysis by Means of the
\np-Median Model (accepted, August, 2013)
\nC. Dong, B.\u00a0Goldengorin, G. Jager, P. Molitor, D. Richter. Backbone
\nBased TSP Heuristics for Large Instances. Accepted by Journal of Heuristics,
\nAugust, 2013.
\nB.\u00a0Goldengorin, D.S. Malyshev, P. M. Pardalos. Effi cient Computation
\nof Tolerances in theWeighted Independent Set Problem on Trees. Doklady
\nMathematics, Computer Science 2013, Vol. 87(3), 368–371.<\/div>\n
B. Goldengorin. Data Correcting Approach\u00a0to Routing and Location in Networks. Handbook of combinatorial optimization. Pardalos, Panos M.; Du, Ding-Zhu; Graham, Ronald L. (Eds.), 2nd Edition, Springer, New York, 2013,\u00a0 http:\/\/www.springer.com\/mathematics\/book\/978-1-4419-7996-4<\/a><\/div>\n
M. Batsyn, B. Goldengorin, E. Maslov, P. M. Pardalos. Improvements to MCS algorithm for the maximum clique problem. Journal of Combinatorial Optimization, pulished online 9 January, 2013. DOI 10.1007\/s10878-012-9592-6<\/div>\n
Batsyn M.V.<\/a>, Bychkov I.S., Goldengorin B.I., Pardalos P.M., Sukhov P.A. Pattern-Based Heuristic for the Cell Formation Problem in Group Technology<\/a> \/\/ Springer Proceedings in Mathematics & Statistics. 2013, 32, <\/strong>\u00a011-50.<\/div>\n
D. Jallo, D. Budai, V. Boginski, B. Goldengorin, P. M. Pardalos. Network-Based Representation of Stock Market Dynamics: An Application to American and Swedish Stock Markets. Springer Proceedings in Mathematics & Statistics, 32<\/strong>, 91-108, 2013.<\/div>\n
D. Korenkevych, F. Skidmore, B. Goldengorin, P. M. Pardalos. How close to optimal are small world properties of human brain networks? Springer Proceedings in Mathematics & Statistics, 32<\/strong>, 119-130, 2013.<\/div>\n
2012<\/strong><\/div>\n
Krushinsky D., Goldengorin B. An exact model for cell formation in group technology<\/a> \/\/ Computational Management Science. 2012, 9<\/strong>(2), 323-338.<\/div>\n
Chistyakov V.V.<\/a>, Goldengorin B.I., Pardalos P.M.<\/a> Extremal values of global tolerances in combinatorial optimization with an additive objective function<\/a> \/\/ Journal of Global Optimization. 2012, 53<\/strong>(3), 475-495.<\/div>\n
Goldengorin B., Krushinsky D., Slomp J. Flexible PMP Approach for Large-Size Cell Formation<\/a> \/\/ Operations Research, 2012, 60<\/strong> (5) 1526-5463.<\/div>\n
Germs R., Goldengorin B., Turkensteen M. Lower tolerance-based Branch and Bound algorithms for the ATSP<\/a> \/\/ Computers & Operations Research. 2012, 39<\/strong>(2), 291-298.<\/div>\n
\u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440\u0438\u043d \u0411.\u0418., \u041f\u0430\u0440\u0434\u0430\u043b\u043e\u0441 \u041f.\u041c.<\/a>, \u0427\u0438\u0441\u0442\u044f\u043a\u043e\u0432 \u0412.\u0412.<\/a> \u0413\u043b\u043e\u0431\u0430\u043b\u044c\u043d\u044b\u0435 \u0434\u043e\u043f\u0443\u0441\u043a\u0438 \u0432 \u0437\u0430\u0434\u0430\u0447\u0430\u0445 \u043a\u043e\u043c\u0431\u0438\u043d\u0430\u0442\u043e\u0440\u043d\u043e\u0439 \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u0438 \u0441 \u0430\u0434\u0434\u0438\u0442\u0438\u0432\u043d\u043e\u0439 \u0446\u0435\u043b\u0435\u0432\u043e\u0439 \u0444\u0443\u043d\u043a\u0446\u0438\u0435\u0439<\/a> \/\/ \u0414\u043e\u043a\u043b\u0430\u0434\u044b \u0430\u043a\u0430\u0434\u0435\u043c\u0438\u0438 \u043d\u0430\u0443\u043a. 2012, 446<\/strong>(1), \u00a021-24.<\/div>\n
\u0412\u0438\u0437\u0433\u0443\u043d\u043e\u0432 \u0410.\u041d.<\/a>, \u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440\u0438\u043d \u0411.\u0418., \u0417\u0430\u043c\u0430\u0440\u0430\u0435\u0432 \u0412.\u0410.<\/a>, \u041a\u0430\u043b\u044f\u0433\u0438\u043d \u0412.\u0410.<\/a>, \u041a\u043e\u043b\u0434\u0430\u043d\u043e\u0432 \u0410.\u041f.<\/a>, \u041a\u043e\u043b\u0434\u0430\u043d\u043e\u0432 \u041f.\u0410.<\/a>, \u041f\u0430\u0440\u0434\u0430\u043b\u043e\u0441 \u041f.\u041c.<\/a> \u041f\u0440\u0438\u043c\u0435\u043d\u0435\u043d\u0438\u0435 \u0440\u044b\u043d\u043e\u0447\u043d\u044b\u0445 \u0433\u0440\u0430\u0444\u043e\u0432 \u043a \u0430\u043d\u0430\u043b\u0438\u0437\u0443 \u0444\u043e\u043d\u0434\u043e\u0432\u043e\u0433\u043e \u0440\u044b\u043d\u043a\u0430<\/a> \/\/ \u0416\u0443\u0440\u043d\u0430\u043b \u043d\u043e\u0432\u043e\u0439 \u044d\u043a\u043e\u043d\u043e\u043c\u0438\u0447\u0435\u0441\u043a\u043e\u0439 \u0430\u0441\u0441\u043e\u0446\u0438\u0430\u0446\u0438\u0438. 2012. \u2116 3, 66-81 (in Russian).<\/div>\n
2011<\/strong><\/div>\n
Goldengorin B.I., Krushinsky D. A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation<\/a> \/\/ Lecture Notes in Computer Science, 2011, \u00a06701<\/strong>, 503-516.<\/div>\n
Goldengorin B.I., Krushinsky D. Complexity evaluation of benchmark instances for the p-median problem<\/a> \/\/ Mathematical and Computer Modelling, 2011, \u00a053<\/strong>(9-10), \u00a01719-1736.<\/div>\n
Albdaiwi B., Ghosh D., Goldengorin B.I. Data aggregation for p-median problems<\/a> \/\/\u00a0 Journal of Combinatorial Optimization. 2011, 21<\/strong>(3), 348-363.<\/div>\n
Goldengorin B.I., Keane J., Kuzmenko V.N., Tso M. Optimal supplier choice with discounting<\/a> \/\/ Journal of Operational Research Society. 2011, 62<\/strong>(4), 690-699.<\/div>\n
2010<\/strong><\/div>\n
B. Goldengorin. Quantitative Logistics<\/strong>: 20 Lectures in Combinatorial Optimization. Lecture Notes. Department of Operations, University of Groningen, Groningen, The Netherlands, 2010, 224 pp.<\/div>\n
Makarenko A., Krushinsky D., Musienko A., Goldengorin B.I. Towards Cellular Automata Football Models with Mentality Accounting<\/a> , in: Cellular Automata. 9th International Conference on Cellular Automata for Research and Industry, ACRI 2010, Ascoli Piceno, Italy, September 21-24, 2010. Proceedings. 2010, 149-152.<\/div>\n
2009<\/strong><\/div>\n
Karapetyan D., Gutin G., Goldengorin B. Empirical evaluation of construction heuristics for the multidimensional assignment problem<\/a> , in: London Algorithmics 2008: Theory and Practice. Texts in Algorithmics. L.: , 2009, 107-122.<\/div>\n
Albdaiwi B., Goldengorin B., Sierksma G. Equivalent instances of the simple plant location problem<\/a> \/\/ Computers & Mathematics with Applications. 2009. Vol. 57. No. 5. P. 812-820.<\/div>\n
Goldengorin B. Maximization of Submodular Functions: Theory and Enumeration Algorithms<\/a> \/\/ European Journal of Operational Research. 2009, 198<\/strong>(1) 102-112.<\/div>\n
Goldengorin B., Makarenko A., Krushinsky D. Synchronization of Movement for a Large-Scale Crowd<\/a> , Chapter 6<\/strong>;\u00a0in: Recent Advances in Nonlinear Dynamics and Synchronization: Theory and Applications. NY: Springer, 2009, 277-306.<\/div>\n
\u041c\u0430\u043a\u0430\u0440\u0435\u043d\u043a\u043e \u041e.\u0421., \u041a\u0440\u0443\u0448\u0438\u043d\u0441\u044c\u043a\u0438\u0439 \u0414., \u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440i\u043d \u0411.I. \u041c\u043e\u0434\u0435\u043b\u044c \u043a\u043b\u0456\u0442\u0438\u043d\u043d\u043e\u0433\u043e \u0430\u0432\u0442\u043e\u043c\u0430\u0442\u0430 \u0437 \u0430\u043d\u0442\u0438\u0441\u0438\u043f\u0430\u0446\u0456\u0454\u044e<\/a> \/\/ \u041d\u0430\u0443\u043a\u043e\u0432\u0456 \u0432\u0456\u0441\u0442\u0456 \u041d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u043e\u0433\u043e \u0442\u0435\u0445\u043d\u0456\u0447\u043d\u043e\u0433\u043e \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442\u0443 \u0423\u043a\u0440\u0430\u0457\u043d\u0438 \u041a\u0438\u0457\u0432\u0441\u044c\u043a\u0438\u0439 \u043f\u043e\u043b\u0456\u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0456\u043d\u0441\u0442\u0438\u0442\u0443\u0442. 2009, 1, 30-35 (in Ukrainian).<\/div>\n
\u0411\u043e\u0439\u043a\u043e \u0412.\u0412., \u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440\u0438\u043d \u0411.\u0418., \u041a\u0443\u0437\u044c\u043c\u0435\u043d\u043a\u043e \u0412.\u041d. \u041e\u0431 \u043e\u0446\u0435\u043d\u043a\u0430\u0445 \u0432 \u0437\u0430\u0434\u0430\u0447\u0435 \u043e \u0440-\u043c\u0435\u0434\u0438\u0430\u043d\u0430\u0445<\/a> \/\/ \u0412 \u043a\u043d.: \u0422\u0435\u043e\u0440i\u044f \u043e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u0438\u0445 \u0440i\u0448\u0435\u043d\u044c , 8<\/strong> , 2009, \u00a022-27 (in Russian).<\/div>\n
2008<\/strong><\/div>\n
Makarenko A., Goldengorin B., Krushinsky D. Game of “Life” with Anticipation Property<\/a> \/\/ Lecture Notes in Computer Science. 2008, \u00a05191<\/strong>, 77-82.<\/div>\n
Goldengorin B., Jager G. The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem<\/a> \/\/ Algorithmic Operational Research. 2008, 3<\/strong> (1), 79-81.<\/div>\n
Turkensteen M., Ghosh D., Goldengorin B.I., Sierksma G. Tolerance-based branch and bound algorithms for the ATSP<\/a> \/\/ European Journal of Operational Research. 2008, 189<\/strong>(3)775-788.<\/div>\n
Ghosh D., Goldengorin B., Gutin G., Jager G. Tolerance-based greedy algorithms for the traveling salesman problem<\/a> , in: Mathematical Programming and Game Theory for Decision Making.\u00a0 World Scientific Publishing, New York, 2008.<\/div>\n
Gutin G., Goldengorin B., Huang J. Worst case analysis of GREEDY, Max-Regret and other heuristics for Multidimensional Assignment and Traveling Salesman problems<\/a> \/\/ Journal of Heuristics. 2008, 14<\/strong>(2), 169-181.<\/div>\n
B. Goldengorin, V. Kuz’menko. Data Compression for p-Median Problems. Collection of papers. Faculty of Applied Mathematics and Computer Technologies, Khmelnitsky National University, Khmelnitsky, Ukraine, 2008, 1<\/strong>, 99-106.<\/div>\n
2007<\/strong><\/div>\n
Richter D., Goldengorin B., Jager G., Molitor P. Improving the efficiency of Helsgaun’s Lin-Kernighan heuristic for the symmetric TSP<\/a> \/\/ Lecture Notes in Computer Science. 2007, \u00a04851<\/strong>, 99-111.<\/div>\n
Ghosh D., Goldengorin B., Gutin G., Jager G. Improving the performance of greedy heuristics for TSPs using tolerances<\/a> \/\/ Communications in Dependability and Quality Management. 2007, 10<\/strong>(1), \u00a052-70.<\/div>\n
Goldengorin B., Keane J., Kuzmenko V.N., Tso M. Optimal order allocation with discount pricing<\/a> \/\/ Lecture Notes in Computer Science. 2007. Vol. 4508. P. 273-284.<\/div>\n
Gutin G., Goldengorin B.I., Huang J. Worst case analysis of GREEDY, Max-Regret and other heuristics for Multidimensional Assignment and Traveling Salesman problems<\/a> \/\/ Lecture Notes in Computer Science. 2007, 4368<\/strong>, 214-225.<\/div>\n
2006<\/strong><\/div>\n
Turkensteen M., Ghosh D., Goldengorin B., Sierksma G. Iterative Patching and the Asymmteric Traveling Salesman Problem<\/a> \/\/\u00a0 Discrete Optimization 2006, 3<\/strong>, 63-77.<\/div>\n
Goldengorin B.I., Makarenko A., Smilianec N. Some applications and prospects of cellular automata in traffic problems<\/a> \/\/ Lecture Notes in Computer Science. 2006, 4173<\/strong>, 532-537.<\/div>\n
Goldengorin B., Jager G., Molitor P. Some basics on tolerances<\/a> \/\/ Lecture Notes in Computer Science. 2006, 4041<\/strong>, 194-206.<\/div>\n
Deza A., Goldengorin B., Pasechnik D. The isometrics of the cut, metric and hypermetric cones<\/a> \/\/ Journal of Algebraic Combinatorics. 2006, 23<\/strong>, \u00a0197-203.<\/div>\n
Goldengorin B., Jager G., Molitor P. Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP<\/a> \/\/ Lecture Notes in Computer Science. 2006, 4235<\/strong>, \u00a086-97.<\/div>\n
Goldengorin B., Jager G., Molitor P. Tolerances applied in combinatorial optimization<\/a> \/\/ Journal of Computer Science. 2006, \u00a02<\/strong> (9), \u00a0716-734.<\/div>\n
\u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440\u0438\u043d \u0411.\u0418., \u0411\u043e\u0439\u043a\u043e \u0412.\u0412., \u041a\u0443\u0437\u044c\u043c\u0435\u043d\u043a\u043e \u0412.\u041d. \u0410\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0434\u043e\u043f\u0443\u0441\u043a\u043e\u0432 \u0434\u043b\u044f \u0440\u0435\u0448\u0435\u043d\u0438\u044f \u0437\u0430\u0434\u0430\u0447 \u043a\u043e\u043c\u0431\u0438\u043d\u0430\u0442\u043e\u0440\u043d\u043e\u0439 \u043e\u043f\u0442\u0438\u043c\u0438\u0437\u0430\u0446\u0438\u0438 (\u0417\u041a\u041e)<\/a> \/\/ \u0412 \u043a\u043d.: \u0422\u0435\u043e\u0440i\u044f \u043e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u0438\u0445 \u0440i\u0448\u0435\u043d\u044c, 5<\/strong>, 2006, 98-104 (in Russian).<\/div>\n
2005<\/strong><\/div>\n
Ghosh D., Goldengorin B., Sierksma G. Data Correcting: A Methodology for Obtaining Near-Optimal Solutions<\/a> , in: Operations Research with Economic and Industrial Applications: Emerging Trends. Anamaya Publisher, New Delphi, \u00a02005.<\/div>\n
Ghosh D., Goldengorin B., Sierksma G. Data correcting algorithms in combinatorial optimization<\/a> , in: Handbook of Combinatorial Optimization. Berlin: Springer, 2005, 1-53.<\/div>\n
Goldengorin B., Ghosh D. The multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem<\/a> \/\/ Journal of Global Optimization. 2005, 32<\/strong>(1),\u00a0 65-82.<\/div>\n
Bekker H., Braad E., Goldengorin B. Using bipartite and multi-dimensional matching to select the rooots of a system of polynomial equations<\/a> \/\/ Lecture Notes in Computer Science, 2005, \u00a03483<\/strong>, \u00a0397-406.<\/div>\n
2004<\/strong><\/div>\n
Goldengorin B., Sierksma G., Turkensteen M., . Tolerance based algorithms for the ATSP<\/a> \/\/ Lecture Notes in Computer Science. 2004, \u00a03353<\/strong>, 222-234.<\/div>\n
\u041a\u0443\u0437\u044c\u043c\u0435\u043d\u043a\u043e \u0412.\u041d., \u0413\u043e\u043b\u044c\u0434\u0435\u043d\u0433\u043e\u0440\u0438\u043d \u0411.\u0418., \u0422\u0441\u043e \u041c., \u0421\u0442\u0435\u0446\u044e\u043a \u041f.\u0418. \u0421\u0440\u0430\u0432\u043d\u0435\u043d\u0438\u0435 \u0434\u0432\u0443\u0445 \u0441\u0443\u0431\u0433\u0440\u0430\u0434\u0438\u0435\u043d\u0442\u043d\u044b\u0445 \u043c\u0435\u0442\u043e\u0434\u043e\u0432 \u043f\u0440\u0438 \u043d\u0430\u0445\u043e\u0436\u0434\u0435\u043d\u0438\u0438 \u043e\u0446\u0435\u043d\u043e\u043a \u0434\u043b\u044f \u0437\u0430\u0434\u0430\u0447 \u0440\u0430\u0437\u043c\u0435\u0449\u0435\u043d\u0438\u044f<\/a> \/\/ \u0412 \u043a\u043d.: \u0422\u0435\u043e\u0440i\u044f \u043e\u043f\u0442\u0438\u043c\u0430\u043b\u044c\u043d\u0438\u0445 \u0440i\u0448\u0435\u043d\u044c 3<\/strong>, 2004, \u00a0108-116 (in Russian).<\/div>\n
Goldengorin B., Ghosh D., Sierksma G. Branch and Peg Algorithms for the Simple Plant Location Problem<\/a> \/\/ Computers & Operations Research. 2003, 30<\/strong>(7), 967-981.<\/div>\n
Goldengorin B., Tijssen G.A., Ghosh D., Sierksma G. Solving the Simple Plant Location Problem Using a Data Correcting Approach<\/a> \/\/ Journal of Global Optimization. 2003, 25<\/strong>(4) 377-406.<\/div>\n
Goldengorin B. Data Correcting Algorithms in Combinatorial Optimization<\/a>. Ph.D. thesis,\u00a0 Research Institute of Systems, Organizations and Management, Groningen,\u00a02002.<\/div>\n
Goldengorin B., Sierksma G., Ghosh D. Improving the efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem<\/a> \/\/ Lecture Notes in Computer Science. 2001, \u00a02141<\/strong>, 106-117.<\/div>\n
1999<\/strong><\/div>\n
Goldengorin B., Sierksma G., Tijssen G.A., Tso M. The Data-Correcting Algorithm for Minimization of Supermodular Functions<\/a> \/\/ Management Science. 1999, 45<\/strong>(11), \u00a01539-1551.<\/div>\n
<\/div>\n","protected":false},"excerpt":{"rendered":"

Home\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CV\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Research Interests\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Publications\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Conference talks\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Teaching\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Contact Information Books B.\u00a0Goldengorin, V.A. Kalyagin, P.M. Pardalos (Eds.) Models, Algorithms,\u00a0and Technologies for Network Analysis. Proceedings of the Second International\u00a0Conference on Network Analysis. Springer Proceedings in Mathematics\u00a0& Statistics, Vol. 59, 2013, 204 http:\/\/www.springer.com\/mathematics\/book\/978-1-4614-8587-2 B.\u00a0Goldengorin, D. Krushinsky, P. M. Pardalos. Cell Formation in Industrial\u00a0Engineering: Theory, Algorithms and Experiments. […]<\/p>\n","protected":false},"author":0,"featured_media":0,"parent":1256,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"page-templates\/page-sidebar-none.php","meta":{"_acf_changed":false,"inline_featured_image":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-1276","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/pages\/1276","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/types\/page"}],"replies":[{"embeddable":true,"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/comments?post=1276"}],"version-history":[{"count":1,"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/pages\/1276\/revisions"}],"predecessor-version":[{"id":3167,"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/pages\/1276\/revisions\/3167"}],"up":[{"embeddable":true,"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/pages\/1256"}],"wp:attachment":[{"href":"https:\/\/ise.ufl.edu\/cao\/wp-json\/wp\/v2\/media?parent=1276"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}