Boris Goldengorin

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 12

Top Topics

Single Machine Scheduling

Weighted Tardiness

Top Venues

J. Glob. Optim.

Optim. Methods Softw.

J. Comb. Optim.

Publications

Tendai Mapungwana Chikake, Boris Goldengorin
A Pseudo-Boolean Polynomials Approach for Image Edge Detection. CoRR (2023)
Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk
Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation. CoRR (2023)
Tendai Mapungwana Chikake, Boris Goldengorin
Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis. CoRR (2023)
Mikhail Cherniavskii, Boris Goldengorin
An almost linear time complexity algorithm for the Tool Loading Problem. CoRR (2022)
Mikhail Cherniavskii, Boris Goldengorin
An improved KTNS algorithm for the job sequencing and tool switching problem. CoRR (2022)
Artem Fomin, Boris Goldengorin
An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Comput. Oper. Res. 142 (2022)
Boris Goldengorin, Vadim V. Romanuke
Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Comput. Ind. Eng. 155 (2021)
Boris Goldengorin, Vadim V. Romanuke
Experimental analysis of tardiness in preemptive single machine scheduling. Expert Syst. Appl. 186 (2021)
Artem Fomin, Boris Goldengorin
An efficient model for the preemptive single machine scheduling of equal-length jobs. CoRR (2020)
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 (2018)
Daniel Karapetyan, Boris Goldengorin
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances. CoRR (2017)
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) (2017)
Julius Zilinskas, Boris Goldengorin, Panos M. Pardalos
Pareto-optimal front of cell formation problem in group technology. J. Glob. Optim. 61 (1) (2015)
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) (2015)
Gerold Jäger, Boris Goldengorin, Panos M. Pardalos
The Theory of Set Tolerances. LION (2014)
Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter
A backbone based TSP heuristic for large instances. J. Heuristics 20 (1) (2014)
Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos
Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27 (2) (2014)
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) (2014)
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) (2014)
Dmitry Krushinsky, Boris Goldengorin
An exact model for cell formation in group technology. Comput. Manag. Sci. 9 (3) (2012)
Remco Germs, Boris Goldengorin, Marcel Turkensteen
Lower tolerance-based Branch and Bound algorithms for the ATSP. Comput. Oper. Res. 39 (2) (2012)
Boris Goldengorin, Dmitry Krushinsky, Jannes Slomp
Flexible PMP Approach for Large-Size Cell Formation. Oper. Res. 60 (5) (2012)
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) (2012)
Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin
-median problems. J. Comb. Optim. 21 (3) (2011)
Boris Goldengorin, Dmitry Krushinsky
Complexity evaluation of benchmark instances for the p-median problem. Math. Comput. Model. 53 (9-10) (2011)
Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso
Optimal supplier choice with discounting. J. Oper. Res. Soc. 62 (4) (2011)
Boris Goldengorin, Dmitry Krushinsky
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation. INOC (2011)
Alexander Makarenko, Dmitriy Krushinski, Anton Musienko, Boris Goldengorin
Towards Cellular Automata Football Models with Mentality Accounting. ACRI (2010)
Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma
Equivalent instances of the simple plant location problem. Comput. Math. Appl. 57 (5) (2009)
Boris Goldengorin
Maximization of submodular functions: Theory and enumeration algorithms. Eur. J. Oper. Res. 198 (1) (2009)
Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin
Empirical evaluation of construction heuristics for the multidimensional assignment problem CoRR (2009)
Alexander Makarenko, Boris Goldengorin, Dmitry Krushinsky
Game 'Life' with Anticipation Property. ACRI (2008)
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) (2008)
Boris Goldengorin, Gerold Jäger
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Oper. Res. 3 (1) (2008)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. 189 (3) (2008)
Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN (2007)
Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso
Optimal Order Allocation with Discount Pricing. AAIM (2007)
Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. 3 (1) (2006)
Boris Goldengorin, Alexander Makarenko, Natalia Smelyanec
Some Applications and Prospects of Cellular Automata in Traffic Problems. ACRI (2006)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Some Basics on Tolerances. AAIM (2006)
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)
Boris Goldengorin, Gerold Jäger, Paul Molitor
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN (2006)
H. Bekker, E. P. Braad, Boris Goldengorin
Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations. ICCSA (4) (2005)
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) (2005)
H. Bekker, E. P. Braad, Boris Goldengorin
Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. WEA (2005)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 31 (2) (2004)
Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
Tolerance Based Algorithms for the ATSP. WG (2004)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. 30 (7) (2003)
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) (2003)
Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE (2001)
Boris Goldengorin
Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998). SIGACT News 31 (2) (2000)