Advanced Search
MyIDEAS: Login to follow this author

Boris Goldengorin

Contents:

This is information that was supplied by Boris Goldengorin in registering through RePEc. If you are Boris Goldengorin , you may change this information at the RePEc Author Service. Or if you are not registered and would like to be listed as well, register at the RePEc Author Service. When you register or update your RePEc registration, you may identify the papers and articles you have authored.

Personal Details

First Name: Boris
Middle Name:
Last Name: Goldengorin
Suffix:

RePEc Short-ID: pgo548

Email: [This author has chosen not to make the email address public]
Homepage:
Postal Address:
Phone:

Affiliation

(50%) Ruimtelijke Economie Groningen
Faculteit Economie en Bedrijfskunde
Rijksuniversiteit Groningen
Location: Groningen, Netherlands
Homepage: http://www.regroningen.nl/
Email:
Phone: +31 50 3633740
Fax: +31 50 3637337
Postal: PO box 800, 9700 AV Groningen
Handle: RePEc:edi:rerugnl (more details at EDIRC)
(50%) University of Florida
Homepage: http://www.ise.ufl.edu/cao/sample-page/boris-goldengorin/
Location: USA, Gainesville, Florida

Works

as in new window

Working papers

  1. Molitor, P. & Jäger, G. & Goldengorin, B., 2005. "Some basics on tolerances," Research Report 05A13, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  2. Jäger, G. & Goldengorin, B., 2005. "How to make a greedy heuristic for the asymmetric traveling salesman problem competitive," Research Report 05A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  3. 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).
  4. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2004. "Iterative Patching and the Asymmetric Traveling Salesman Problem," Research Report 04A27, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  5. Goldengorin, Boris & Sierksma, Gerard, 2003. "Combinatorial optimization tolerances calculated in linear time," Research Report 03A30, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  6. Deza, Antoine & Goldengorin, Boris & Pasechnik, Dmitrii V., 2003. "The isometries of the cut, metric and hypermetric cones," Research Report 03A24, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  7. Ghosh, Diptesh & Goldengorin, Boris, 2001. "The binary knapsack problem: solutions with guaranteed quality," Research Report 01A64, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  8. 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).
  9. 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).
  10. 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).
  11. 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).
  12. 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).
  13. Goldengorin, Boris & Sierksma, Gerard & Tijssen, Gert A., 1998. "The data-correcting algorithm for supermodular functions, with applications to quadratic cost partition and simple plant location problems," Research Report 98A08, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  14. Ghosh, Diptesh & Goldengorin, Boris, . "Obtaining Near OptimalSolutions for the Binary Knapsack Problem," IIMA Working Papers WP2002-02-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
  15. Goldengorin, Boris & Ghosh, Diptesh & Sierksma Gerard, . "Data Correcting Algorithms in Combinatorial Optimization," IIMA Working Papers WP2004-04-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
  16. Ghosh, Diptesh & Goldengorin, Boris, . "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.
  17. Ghosh, Diptesh & Goldengorin, Boris & Sierksma Gerard, . "Data Correcting: A Methodologyfor obtaining near-optimal solutions," IIMA Working Papers WP2002-06-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

Articles

  1. 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.
  2. 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.
  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.
  4. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
  5. 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.
  6. 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.

NEP Fields

7 papers by this author were announced in NEP, and specifically in the following field reports (number of papers):
  1. NEP-CMP: Computational Economics (3) 2003-09-14 2004-12-12 2006-01-29. Author is listed

Statistics

Most cited item

Most downloaded item (past 12 months)

Access and download statistics for all items

Corrections

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.