default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Goldengorin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i8]Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk:
Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation. CoRR abs/2308.15453 (2023)- [i7]Tendai Mapungwana Chikake, Boris Goldengorin:
Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis. CoRR abs/2308.15553 (2023) - [i6]Tendai Mapungwana Chikake, Boris Goldengorin:
A Pseudo-Boolean Polynomials Approach for Image Edge Detection. CoRR abs/2308.15557 (2023) - 2022
- [j30]Artem Fomin
, Boris Goldengorin:
An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Comput. Oper. Res. 142: 105742 (2022) - [i5]Mikhail Cherniavskii, Boris Goldengorin:
An improved KTNS algorithm for the job sequencing and tool switching problem. CoRR abs/2205.06042 (2022) - [i4]Mikhail Cherniavskii, Boris Goldengorin:
An almost linear time complexity algorithm for the Tool Loading Problem. CoRR abs/2207.02004 (2022) - 2021
- [j29]Boris Goldengorin, Vadim V. Romanuke:
Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Comput. Ind. Eng. 155: 107090 (2021) - [j28]Boris Goldengorin, Vadim V. Romanuke:
Experimental analysis of tardiness in preemptive single machine scheduling. Expert Syst. Appl. 186: 114947 (2021) - 2020
- [i3]Artem Fomin, Boris Goldengorin:
An efficient model for the preemptive single machine scheduling of equal-length jobs. CoRR abs/2012.08152 (2020)
2010 – 2019
- 2018
- [j27]Ehsan Ahmadi, Boris Goldengorin, Gürsel A. Süer, Hadi Mosadegh:
A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Appl. Soft Comput. 65: 214-229 (2018) - 2017
- [j26]Marcel Turkensteen, Dmitriy S. Malyshev, Boris Goldengorin, Panos M. Pardalos:
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. J. Glob. Optim. 68(3): 601-622 (2017) - [i2]Daniel Karapetyan, Boris Goldengorin:
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances. CoRR abs/1711.06347 (2017) - 2015
- [j25]Boris I. Goldengorin, Dmitriy S. Malyshev, Panos M. Pardalos, Victor Zamaraev:
A tolerance-based heuristic approach for the weighted independent set problem. J. Comb. Optim. 29(2): 433-450 (2015) - [j24]Julius Zilinskas, Boris Goldengorin, Panos M. Pardalos:
Pareto-optimal front of cell formation problem in group technology. J. Glob. Optim. 61(1): 91-108 (2015) - [j23]Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin, Shanlin Yang:
Preemptive scheduling in a two-stage supply chain to minimize the makespan. Optim. Methods Softw. 30(4): 727-747 (2015) - 2014
- [j22]Arsenii Vizgunov, Boris Goldengorin, Valeriy A. Kalyagin, Alexander P. Koldanov, Petr A. Koldanov, Panos M. Pardalos:
Network approach for the Russian stock market. Comput. Manag. Sci. 11(1-2): 45-55 (2014) - [j21]Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter:
A backbone based TSP heuristic for large instances. J. Heuristics 20(1): 107-124 (2014) - [j20]Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos:
Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2): 397-416 (2014) - [j19]Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov:
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time. Optim. Methods Softw. 29(5): 955-963 (2014) - [c14]Gerold Jäger, Boris Goldengorin, Panos M. Pardalos:
The Theory of Set Tolerances. LION 2014: 362-377 - 2012
- [j18]Dmitry Krushinsky, Boris Goldengorin:
An exact model for cell formation in group technology. Comput. Manag. Sci. 9(3): 323-338 (2012) - [j17]Remco Germs, Boris Goldengorin, Marcel Turkensteen:
Lower tolerance-based Branch and Bound algorithms for the ATSP. Comput. Oper. Res. 39(2): 291-298 (2012) - [j16]Boris Goldengorin, Dmitry Krushinsky, Jannes Slomp:
Flexible PMP Approach for Large-Size Cell Formation. Oper. Res. 60(5): 1157-1166 (2012) - [j15]Vyacheslav V. Chistyakov, Boris Goldengorin, Panos M. Pardalos:
Extremal values of global tolerances in combinatorial optimization with an additive objective function. J. Glob. Optim. 53(3): 475-495 (2012) - 2011
- [j14]Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin:
Data aggregation for p-median problems. J. Comb. Optim. 21(3): 348-363 (2011) - [j13]Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso:
Optimal supplier choice with discounting. J. Oper. Res. Soc. 62(4): 690-699 (2011) - [j12]Boris Goldengorin, Dmitry Krushinsky:
Complexity evaluation of benchmark instances for the p-median problem. Math. Comput. Model. 53(9-10): 1719-1736 (2011) - [c13]Boris Goldengorin, Dmitry Krushinsky:
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation. INOC 2011: 503-516 - 2010
- [c12]Alexander Makarenko, Dmitriy Krushinski, Anton Musienko, Boris Goldengorin:
Towards Cellular Automata Football Models with Mentality Accounting. ACRI 2010: 149-152
2000 – 2009
- 2009
- [j11]Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma:
Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57(5): 812-820 (2009) - [j10]Boris Goldengorin:
Maximization of submodular functions: Theory and enumeration algorithms. Eur. J. Oper. Res. 198(1): 102-112 (2009) - [p1]Boris Goldengorin, Dmitry Krushinsky, Alexander Makarenko:
Synchronization of Movement for a Large-Scale Crowd. Recent Advances in Nonlinear Dynamics and Synchronization 2009: 277-303 - [i1]Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin:
Empirical evaluation of construction heuristics for the multidimensional assignment problem. CoRR abs/0906.2960 (2009) - 2008
- [j9]Boris Goldengorin, Gerold Jäger:
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Oper. Res. 3(1) (2008) - [j8]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189(3): 775-788 (2008) - [j7]Gregory Z. Gutin, Boris Goldengorin, Jing Huang:
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. J. Heuristics 14(2): 169-181 (2008) - [c11]Alexander Makarenko, Boris Goldengorin, Dmitry Krushinsky:
Game 'Life' with Anticipation Property. ACRI 2008: 77-82 - 2007
- [c10]Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso:
Optimal Order Allocation with Discount Pricing. AAIM 2007: 273-284 - [c9]Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN 2007: 99-111 - 2006
- [j6]Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3(1): 63-77 (2006) - [c8]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Some Basics on Tolerances. AAIM 2006: 194-206 - [c7]Boris Goldengorin, Alexander Makarenko, Natalia Smelyanec:
Some Applications and Prospects of Cellular Automata in Traffic Problems. ACRI 2006: 532-537 - [c6]Boris Goldengorin, Gerold Jäger, Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97 - [c5]Gregory Z. Gutin, Boris Goldengorin, Jing Huang:
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. WAOA 2006: 214-225 - 2005
- [j5]Boris Goldengorin, Diptesh Ghosh:
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem. J. Glob. Optim. 32(1): 65-82 (2005) - [c4]Henk Bekker, E. P. Braad, Boris Goldengorin:
Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations. ICCSA (4) 2005: 397-406 - [c3]Henk Bekker, E. P. Braad, Boris Goldengorin:
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. WEA 2005: 610-613 - 2004
- [j4]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31(2): 241-255 (2004) - [c2]Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen:
Tolerance Based Algorithms for the ATSP. WG 2004: 222-234 - 2003
- [j3]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30(7): 967-981 (2003) - [j2]Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma:
Solving the Simple Plant Location Problem using a Data Correcting Approach. J. Glob. Optim. 25(4): 377-406 (2003) - 2001
- [c1]Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma:
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE 2001: 106-117 - 2000
- [j1]Boris Goldengorin:
Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998). SIGACT News 31(2): 5-9 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
