Boris Goldengorin

According to our database, Boris Goldengorin authored at least 52 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Pseudo-Boolean Polynomials Approach for Image Edge Detection.

Tendai Mapungwana Chikake, Boris Goldengorin

CoRR, 2023

Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis.

Tendai Mapungwana Chikake, Boris Goldengorin

CoRR, 2023

Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation.

Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk

CoRR, 2023

Image edge detection using pseudo-Boolean polynomials.

Tendai Mapungwana Chikake, Boris Goldengorin

Proceedings of the Sixteenth International Conference on Machine Vision, 2023

2022

An almost linear time complexity algorithm for the Tool Loading Problem.

Mikhail Cherniavskii, Boris Goldengorin

CoRR, 2022

An improved KTNS algorithm for the job sequencing and tool switching problem.

Mikhail Cherniavskii, Boris Goldengorin

CoRR, 2022

An exact algorithm for the preemptive single machine scheduling of equal-length jobs.

Artem Fomin, Boris Goldengorin

Comput. Oper. Res., 2022

2021

Experimental analysis of tardiness in preemptive single machine scheduling.

Boris Goldengorin, Vadim V. Romanuke

Expert Syst. Appl., 2021

Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness.

Boris Goldengorin, Vadim V. Romanuke

Comput. Ind. Eng., 2021

2020

An efficient model for the preemptive single machine scheduling of equal-length jobs.

Artem Fomin, Boris Goldengorin

CoRR, 2020

2018

A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem.

Ehsan Ahmadi, Boris Goldengorin, Gürsel A. Süer, Hadi Mosadegh

Appl. Soft Comput., 2018

2017

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems.

Marcel Turkensteen, Dmitriy S. Malyshev, Boris Goldengorin, Panos M. Pardalos

J. Glob. Optim., 2017

Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances.

Daniel Karapetyan, Boris Goldengorin

CoRR, 2017

2015

Preemptive scheduling in a two-stage supply chain to minimize the makespan.

Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin, Shanlin Yang

Optim. Methods Softw., 2015

Pareto-optimal front of cell formation problem in group technology.

Julius Zilinskas, Boris Goldengorin, Panos M. Pardalos

J. Glob. Optim., 2015

A tolerance-based heuristic approach for the weighted independent set problem.

Boris I. Goldengorin, Dmitriy S. Malyshev, Panos M. Pardalos, Victor Zamaraev

J. Comb. Optim., 2015

2014

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time.

Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov

Optim. Methods Softw., 2014

Improvements to MCS algorithm for the maximum clique problem.

Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos

J. Comb. Optim., 2014

A backbone based TSP heuristic for large instances.

Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter

J. Heuristics, 2014

Network approach for the Russian stock market.

Arsenii Vizgunov, Boris Goldengorin, Valeriy A. Kalyagin, Alexander P. Koldanov, Petr A. Koldanov, Panos M. Pardalos

Comput. Manag. Sci., 2014

The Theory of Set Tolerances.

Gerold Jäger, Boris Goldengorin, Panos M. Pardalos

Proceedings of the Learning and Intelligent Optimization, 2014

2012

Extremal values of global tolerances in combinatorial optimization with an additive objective function.

Vyacheslav V. Chistyakov, Boris Goldengorin, Panos M. Pardalos

J. Glob. Optim., 2012

Flexible PMP Approach for Large-Size Cell Formation.

Boris Goldengorin, Dmitry Krushinsky, Jannes Slomp

Oper. Res., 2012

Lower tolerance-based Branch and Bound algorithms for the ATSP.

Remco Germs, Boris Goldengorin, Marcel Turkensteen

Comput. Oper. Res., 2012

An exact model for cell formation in group technology.

Dmitry Krushinsky, Boris Goldengorin

Comput. Manag. Sci., 2012

2011

Complexity evaluation of benchmark instances for the p-median problem.

Boris Goldengorin, Dmitry Krushinsky

Math. Comput. Model., 2011

Optimal supplier choice with discounting.

Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso

J. Oper. Res. Soc., 2011

Data aggregation for <i>p</i>-median problems.

Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin

J. Comb. Optim., 2011

A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation.

Boris Goldengorin, Dmitry Krushinsky

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Towards Cellular Automata Football Models with Mentality Accounting.

Alexander Makarenko, Dmitriy Krushinski, Anton Musienko, Boris Goldengorin

Proceedings of the Cellular Automata, 2010

2009

Synchronization of Movement for a Large-Scale Crowd.

Boris Goldengorin, Dmitry Krushinsky, Alexander Makarenko

Proceedings of the Recent Advances in Nonlinear Dynamics and Synchronization: Theory and Applications, 2009

Maximization of submodular functions: Theory and enumeration algorithms.

Boris Goldengorin

Eur. J. Oper. Res., 2009

Empirical evaluation of construction heuristics for the multidimensional assignment problem

Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin

CoRR, 2009

Equivalent instances of the simple plant location problem.

Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma

Comput. Math. Appl., 2009

2008

Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.

Gregory Z. Gutin, Boris Goldengorin, Jing Huang

J. Heuristics, 2008

Tolerance-based Branch and Bound algorithms for the ATSP.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Eur. J. Oper. Res., 2008

The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.

Boris Goldengorin, Gerold Jäger

Algorithmic Oper. Res., 2008

Game 'Life' with Anticipation Property.

Alexander Makarenko, Boris Goldengorin, Dmitry Krushinsky

Proceedings of the Cellular Automata, 2008

2007

Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.

Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Optimal Order Allocation with Discount Pricing.

Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Iterative patching and the asymmetric traveling salesman problem.

Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma

Discret. Optim., 2006

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.

Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Some Applications and Prospects of Cellular Automata in Traffic Problems.

Boris Goldengorin, Alexander Makarenko, Natalia Smelyanec

Proceedings of the Cellular Automata, 2006

Some Basics on Tolerances.

Boris Goldengorin, Gerold Jäger, Paul Molitor

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem.

Boris Goldengorin, Diptesh Ghosh

J. Glob. Optim., 2005

Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching.

Henk Bekker, E. P. Braad, Boris Goldengorin

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations.

Henk Bekker, E. P. Braad, Boris Goldengorin

Proceedings of the Computational Science and Its Applications, 2005

2004

Tolerance Based Algorithms for the ATSP.

Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003

Solving the Simple Plant Location Problem using a Data Correcting Approach.

Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma

J. Glob. Optim., 2003

Branch and peg algorithms for the simple plant location problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Comput. Oper. Res., 2003

2001

Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.

Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma

Proceedings of the Algorithm Engineering, 2001

2000

Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998).

Boris Goldengorin

SIGACT News, 2000