IDEAS home Printed from https://ideas.repec.org/f/pgo548.html
   My authors  Follow this author

Boris Goldengorin

Personal Details

First Name:Boris
Middle Name:
Last Name:Goldengorin
Suffix:
RePEc Short-ID:pgo548
[This author has chosen not to make the email address public]

Affiliation

(50%) Ruimtelijke Economie Groningen
Faculteit Economie en Bedrijfskunde
Rijksuniversiteit Groningen

Groningen, Netherlands
http://www.regroningen.nl/
RePEc:edi:rerugnl (more details at EDIRC)

(50%) University of Florida

http://www.ise.ufl.edu/cao/sample-page/boris-goldengorin/
USA, Gainesville, Florida

Research output

as
Jump to: Working papers Articles

Working papers

  1. Goldengorin, Boris & Ghosh, Diptesh & Sierksma Gerard, 2004. "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers WP2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  2. Ghosh, Diptesh & Goldengorin, Boris & Sierksma Gerard, 2002. "Data Correcting: A Methodologyfor obtaining near-optimal solutions," IIMA Working Papers WP2002-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
  3. Ghosh, Diptesh & Goldengorin, Boris, 2002. "The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram," IIMA Working Papers WP2002-06-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
  4. Ghosh, Diptesh & Goldengorin, Boris, 2002. "Obtaining Near OptimalSolutions for the Binary Knapsack Problem," IIMA Working Papers WP2002-02-03, Indian Institute of Management Ahmedabad, Research and Publication Department.

Articles

  1. Julius Žilinskas & Boris Goldengorin & Panos Pardalos, 2015. "Pareto-optimal front of cell formation problem in group technology," Journal of Global Optimization, Springer, vol. 61(1), pages 91-108, January.
  2. A. Vizgunov & B. Goldengorin & V. Kalyagin & A. Koldanov & P. Koldanov & P. Pardalos, 2014. "Network approach for the Russian stock market," Computational Management Science, Springer, vol. 11(1), pages 45-55, January.
  3. Vizgunov, A. & Goldengorin, B. & Zamaraev, V. & Kalyagin, V. & Koldanov, A. & Koldanov, P. & Pardalos, P., 2012. "Applying Market Graphs for Russian Stock Market Analysis," Journal of the New Economic Association, New Economic Association, vol. 15(3), pages 66-81.
  4. Dmitry Krushinsky & Boris Goldengorin, 2012. "An exact model for cell formation in group technology," Computational Management Science, Springer, vol. 9(3), pages 323-338, August.
  5. Vyacheslav Chistyakov & Boris Goldengorin & Panos Pardalos, 2012. "Extremal values of global tolerances in combinatorial optimization with an additive objective function," Journal of Global Optimization, Springer, vol. 53(3), pages 475-495, July.
  6. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
  7. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2008. "Tolerance-based Branch and Bound algorithms for the ATSP," European Journal of Operational Research, Elsevier, vol. 189(3), pages 775-788, September.
  8. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Goldengorin, Boris & Ghosh, Diptesh & Sierksma Gerard, 2004. "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers WP2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department.

    Cited by:

    1. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

Articles

  1. A. Vizgunov & B. Goldengorin & V. Kalyagin & A. Koldanov & P. Koldanov & P. Pardalos, 2014. "Network approach for the Russian stock market," Computational Management Science, Springer, vol. 11(1), pages 45-55, January.

    Cited by:

    1. Yong Tang & Jason Jie Xiong & Zi-Yang Jia & Yi-Cheng Zhang, 2018. "Complexities in Financial Network Topological Dynamics: Modeling of Emerging and Developed Stock Markets," Complexity, Hindawi, vol. 2018, pages 1-31, November.
    2. Esmalifalak, Hamidreza, 2022. "Euclidean (dis)similarity in financial network analysis," Global Finance Journal, Elsevier, vol. 53(C).
    3. V. A. Kalyagin & A. P. Koldanov & P. A. Koldanov & P. M. Pardalos & V. A. Zamaraev, 2013. "Measures of uncertainty in market network analysis," Papers 1311.2273, arXiv.org.
    4. V. A. Kalyagin & A. P. Koldanov & P. A. Koldanov & P. M. Pardalos, 2018. "Optimal decision for the market graph identification problem in a sign similarity network," Annals of Operations Research, Springer, vol. 266(1), pages 313-327, July.
    5. Chu, J. & Nadarajah, S., 2017. "A statistical analysis of UK financial networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 445-459.
    6. Xiurong Chen & Aimin Hao & Yali Li, 2020. "The impact of financial contagion on real economy-An empirical research based on combination of complex network technology and spatial econometrics model," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-20, March.
    7. Zappa, Paola & Vu, Duy Q., 2021. "Markets as networks evolving step by step: Relational Event Models for the interbank market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    8. V. A. Kalyagin & P. A. Koldanov & P. M. Pardalos, 2015. "Optimal decision for the market graph identification problem in sign similarity network," Papers 1512.06449, arXiv.org.
    9. Kalyagin, V.A. & Koldanov, A.P. & Koldanov, P.A. & Pardalos, P.M. & Zamaraev, V.A., 2014. "Measures of uncertainty in market network analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 413(C), pages 59-70.
    10. Gang-Jin Wang & Chi Xie & H. Eugene Stanley, 2018. "Correlation Structure and Evolution of World Stock Markets: Evidence from Pearson and Partial Correlation-Based Networks," Computational Economics, Springer;Society for Computational Economics, vol. 51(3), pages 607-635, March.
    11. Ling, Yu-Xiu & Xie, Chi & Wang, Gang-Jin, 2022. "Interconnectedness between convertible bonds and underlying stocks in the Chinese capital market: A multilayer network perspective," Emerging Markets Review, Elsevier, vol. 52(C).

  2. Vizgunov, A. & Goldengorin, B. & Zamaraev, V. & Kalyagin, V. & Koldanov, A. & Koldanov, P. & Pardalos, P., 2012. "Applying Market Graphs for Russian Stock Market Analysis," Journal of the New Economic Association, New Economic Association, vol. 15(3), pages 66-81.

    Cited by:

    1. Koldanov, A. & Koldanov, P. & Semenov, D., 2021. "Confidence set for connected stocks of stock market," Journal of the New Economic Association, New Economic Association, vol. 50(2), pages 12-34.
    2. Kalyagin, V. & Koldanov, A. & Koldanov, P. & Pardalos, P., 2017. "Statistical Procedures for Stock Markets Network Structures Identification," Journal of the New Economic Association, New Economic Association, vol. 35(3), pages 33-52.

  3. Dmitry Krushinsky & Boris Goldengorin, 2012. "An exact model for cell formation in group technology," Computational Management Science, Springer, vol. 9(3), pages 323-338, August.

    Cited by:

    1. Mohd Fahmi Bin Mad Ali & Mohd Khairol Anuar Bin Mohd Ariffin & Aidin Delgoshaei & Faizal Bin Mustapha & Eris Elianddy Bin Supeni, 2023. "A Comprehensive 3-Phase Framework for Determining the Customer’s Product Usage in a Food Supply Chain," Mathematics, MDPI, vol. 11(5), pages 1-20, February.
    2. Alena Otto & Erwin Pesch, 2017. "Operation of shunting yards: train-to-yard assignment problem," Journal of Business Economics, Springer, vol. 87(4), pages 465-486, May.
    3. Mohd Fahmi Bin Mad Ali & Mohd Khairol Anuar Bin Mohd Ariffin & Faizal Bin Mustapha & Eris Elianddy Bin Supeni, 2021. "An Unsupervised Machine Learning-Based Framework for Transferring Local Factories into Supply Chain Networks," Mathematics, MDPI, vol. 9(23), pages 1-31, December.

  4. Vyacheslav Chistyakov & Boris Goldengorin & Panos Pardalos, 2012. "Extremal values of global tolerances in combinatorial optimization with an additive objective function," Journal of Global Optimization, Springer, vol. 53(3), pages 475-495, July.

    Cited by:

    1. Vyacheslav V. Chistyakov & Panos M. Pardalos, 2015. "Stability Analysis in Discrete Optimization Involving Generalized Addition Operations," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 585-616, November.

  5. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.

    Cited by:

    1. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2015. "Multi-level facility location as the maximization of a submodular set function," European Journal of Operational Research, Elsevier, vol. 247(3), pages 1013-1016.
    2. Chuangen Gao & Shuyang Gu & Jiguo Yu & Hai Du & Weili Wu, 2022. "Adaptive seeding for profit maximization in social networks," Journal of Global Optimization, Springer, vol. 82(2), pages 413-432, February.
    3. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2017. "Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 767-779, November.
    4. Ivan Contreras & Elena Fernández, 2014. "Hub Location as the Minimization of a Supermodular Set Function," Operations Research, INFORMS, vol. 62(3), pages 557-570, June.
    5. Zhenning Zhang & Donglei Du & Yanjun Jiang & Chenchen Wu, 2021. "Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint," Journal of Global Optimization, Springer, vol. 80(3), pages 595-616, July.
    6. Francisco Casas & Claudio E. Torres & Ignacio Araya, 2022. "A heuristic search based on diversity for solving combinatorial problems," Journal of Heuristics, Springer, vol. 28(3), pages 287-328, June.
    7. Zhicheng Liu & Longkun Guo & Donglei Du & Dachuan Xu & Xiaoyan Zhang, 2022. "Maximization problems of balancing submodular relevance and supermodular diversity," Journal of Global Optimization, Springer, vol. 82(1), pages 179-194, January.
    8. Cheng Lu & Wenguo Yang & Ruiqi Yang & Suixiang Gao, 2022. "Maximizing a non-decreasing non-submodular function subject to various types of constraints," Journal of Global Optimization, Springer, vol. 83(4), pages 727-751, August.

  6. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2008. "Tolerance-based Branch and Bound algorithms for the ATSP," European Journal of Operational Research, Elsevier, vol. 189(3), pages 775-788, September.

    Cited by:

    1. Vyacheslav V. Chistyakov & Panos M. Pardalos, 2015. "Stability Analysis in Discrete Optimization Involving Generalized Addition Operations," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 585-616, November.
    2. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    3. Castro de Andrade, Rafael, 2016. "New formulations for the elementary shortest-path problem visiting a given set of nodes," European Journal of Operational Research, Elsevier, vol. 254(3), pages 755-768.
    4. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.

  7. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.

    Cited by:

    1. Goldengorin, Boris & Vink, Marius de, 1999. "Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms," Research Report 99A50, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    2. Tingting Cui & Yanfeng Ouyang & Zuo-Jun Max Shen, 2010. "Reliable Facility Location Design Under the Risk of Disruptions," Operations Research, INFORMS, vol. 58(4-part-1), pages 998-1011, August.
    3. Ghosh, Diptesh & Sierksma, Gerard & Goldengorin, Boris & AlMohammad, Bader F., 2000. "Equivalent instances of the simple plant location problem," Research Report 00A54, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    4. Barros, Lilian & Riley, Michael, 2001. "A combinatorial approach to level of repair analysis," European Journal of Operational Research, Elsevier, vol. 129(2), pages 242-251, March.
    5. Yu, Guodong & Haskell, William B. & Liu, Yang, 2017. "Resilient facility location against the risk of disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 82-105.
    6. Goldengorin, Boris & Ghosh, Diptesh & Sierksma, Gerard, 2001. "Branch and peg algorithms for the simple plant location problem," Research Report 01A14, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    7. Zsolt Sándor & Michel Wedel, 2002. "Profile Construction in Experimental Choice Designs for Mixed Logit Models," Marketing Science, INFORMS, vol. 21(4), pages 455-475, February.
    8. Cui, Tingting & Ouyang, Yanfeng & Shen, Zuo-Jun Max J, 2010. "Reliable Facility Location Design under the Risk of Disruptions," University of California Transportation Center, Working Papers qt5sh2c7pw, University of California Transportation Center.
    9. Goldengorin, Boris & Tijssen, Gert A. & Tso, Michael, 1999. "The maximization of submodular functions : old and new proofs for the correctness of the dichotomy algorithm," Research Report 99A17, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    10. Jing-Sheng Song & Yue Zhang, 2020. "Stock or Print? Impact of 3-D Printing on Spare Parts Logistics," Management Science, INFORMS, vol. 66(9), pages 3860-3878, September.
    11. Vincent Tulasi & Isaac Kwasi Adu & Elikem Kofi Krampa, 2016. "Location of Farmers Warehouse at Adaklu Traditional Area, Volta Region, Ghana," Journal of Optimization, Hindawi, vol. 2016, pages 1-10, July.
    12. Goldengorin, Boris, 2001. "Solving the simple plant location problem using a data correcting approach," Research Report 01A53, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    13. Zhicheng Liu & Longkun Guo & Donglei Du & Dachuan Xu & Xiaoyan Zhang, 2022. "Maximization problems of balancing submodular relevance and supermodular diversity," Journal of Global Optimization, Springer, vol. 82(1), pages 179-194, January.
    14. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    15. Goldengorin, Boris & Ghosh, Diptesh, 2004. "A Multilevel Search Algorithm for the Maximization of Submodular Functions," Research Report 04A20, University of Groningen, Research Institute SOM (Systems, Organisations and Management).

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Boris Goldengorin should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.