Boris Goldengorin

54 papers B 2C 4Journal 38Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Computational Study of the Tool Replacement Problem. INFORMS J. Comput. Yuzhuo Qiu, Mikhail Cherniavskii, Boris Goldengorin, Panos M. Pardalos
2023	J	`jnl`	A Pseudo-Boolean Polynomials Approach for Image Edge Detection. CoRR Tendai Mapungwana Chikake, Boris Goldengorin
2023	J	`jnl`	Dimensionality Reduction Using pseudo-Boolean polynomials For Cluster Analysis. CoRR Tendai Mapungwana Chikake, Boris Goldengorin
2023	C	`conf`	Image edge detection using pseudo-Boolean polynomials. ICMV Tendai Mapungwana Chikake, Boris Goldengorin
2023	J	`jnl`	Pseudo-Boolean Polynomials Approach To Edge Detection And Image Segmentation. CoRR Tendai Mapungwana Chikake, Boris Goldengorin, Alexey Samosyuk
2022	J	`jnl`	An almost linear time complexity algorithm for the Tool Loading Problem. CoRR Mikhail Cherniavskii, Boris Goldengorin
2022	J	`jnl`	An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Comput. Oper. Res. Artem Fomin, Boris Goldengorin
2022	J	`jnl`	An improved KTNS algorithm for the job sequencing and tool switching problem. CoRR Mikhail Cherniavskii, Boris Goldengorin
2021	J	`jnl`	Experimental analysis of tardiness in preemptive single machine scheduling. Expert Syst. Appl. Boris Goldengorin, Vadim V. Romanuke
2021	J	`jnl`	Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Comput. Ind. Eng. Boris Goldengorin, Vadim V. Romanuke
2020	J	`jnl`	An efficient model for the preemptive single machine scheduling of equal-length jobs. CoRR Artem Fomin, Boris Goldengorin
2018	J	`jnl`	A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Appl. Soft Comput. Ehsan Ahmadi, Boris Goldengorin, Gürsel A. Süer, Hadi Mosadegh
2017	J	`jnl`	Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances. CoRR Daniel Karapetyan, Boris Goldengorin
2017	J	`jnl`	The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. J. Glob. Optim. Marcel Turkensteen, Dmitriy S. Malyshev, Boris Goldengorin, Panos M. Pardalos
2015	J	`jnl`	Pareto-optimal front of cell formation problem in group technology. J. Glob. Optim. Julius Zilinskas, Boris Goldengorin, Panos M. Pardalos
2015	J	`jnl`	Preemptive scheduling in a two-stage supply chain to minimize the makespan. Optim. Methods Softw. Jun Pei, Wenjuan Fan, Panos M. Pardalos, Xinbao Liu, Boris Goldengorin, Shanlin Yang
2014	J	`jnl`	A backbone based TSP heuristic for large instances. J. Heuristics Gerold Jäger, Changxing Dong, Boris Goldengorin, Paul Molitor, Dirk Richter
2014	J	`jnl`	Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos
2014	J	`jnl`	Network approach for the Russian stock market. Comput. Manag. Sci. Arsenii Vizgunov, Boris Goldengorin, Valeriy A. Kalyagin, Alexander P. Koldanov, Petr A. Koldanov, Panos M. Pardalos
2014	J	`jnl`	Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time. Optim. Methods Softw. Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov
2014	—	`conf`	The Theory of Set Tolerances. LION Gerold Jäger, Boris Goldengorin, Panos M. Pardalos
2012	J	`jnl`	An exact model for cell formation in group technology. Comput. Manag. Sci. Dmitry Krushinsky, Boris Goldengorin
2012	J	`jnl`	Extremal values of global tolerances in combinatorial optimization with an additive objective function. J. Glob. Optim. Vyacheslav V. Chistyakov, Boris Goldengorin, Panos M. Pardalos
2012	J	`jnl`	Flexible PMP Approach for Large-Size Cell Formation. Oper. Res. Boris Goldengorin, Dmitry Krushinsky, Jannes Slomp
2012	J	`jnl`	Lower tolerance-based Branch and Bound algorithms for the ATSP. Comput. Oper. Res. Remco Germs, Boris Goldengorin, Marcel Turkensteen
2011	C	`conf`	A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation. INOC Boris Goldengorin, Dmitry Krushinsky
2011	J	`jnl`	Complexity evaluation of benchmark instances for the p-median problem. Math. Comput. Model. Boris Goldengorin, Dmitry Krushinsky
2011	J	`jnl`	Data aggregation for J. Comb. Optim. Bader F. AlBdaiwi, Diptesh Ghosh, Boris Goldengorin
2011	J	`jnl`	Optimal supplier choice with discounting. J. Oper. Res. Soc. Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso
2010	—	`conf`	Towards Cellular Automata Football Models with Mentality Accounting. ACRI Alexander Makarenko, Dmitriy Krushinski, Anton Musienko, Boris Goldengorin
2009	J	`jnl`	Empirical evaluation of construction heuristics for the multidimensional assignment problem CoRR Daniel Karapetyan, Gregory Z. Gutin, Boris Goldengorin
2009	J	`jnl`	Equivalent instances of the simple plant location problem. Comput. Math. Appl. Bader F. AlBdaiwi, Boris Goldengorin, Gerard Sierksma
2009	J	`jnl`	Maximization of submodular functions: Theory and enumeration algorithms. Eur. J. Oper. Res. Boris Goldengorin
2009	—	`ch.`	Synchronization of Movement for a Large-Scale Crowd. Recent Advances in Nonlinear Dynamics and Synchronization Boris Goldengorin, Dmitry Krushinsky, Alexander Makarenko
2008	—	`conf`	Game 'Life' with Anticipation Property. ACRI Alexander Makarenko, Boris Goldengorin, Dmitry Krushinsky
2008	J	`jnl`	The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem. Algorithmic Oper. Res. Boris Goldengorin, Gerold Jäger
2008	J	`jnl`	Tolerance-based Branch and Bound algorithms for the ATSP. Eur. J. Oper. Res. Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
2008	J	`jnl`	Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. J. Heuristics Gregory Z. Gutin, Boris Goldengorin, Jing Huang
2007	—	`conf`	Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP. CAAN Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
2007	C	`conf`	Optimal Order Allocation with Discount Pricing. AAIM Boris Goldengorin, John A. Keane, Viktor Kuzmenko, Michael Tso
2006	J	`jnl`	Iterative patching and the asymmetric traveling salesman problem. Discret. Optim. Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
2006	—	`conf`	Some Applications and Prospects of Cellular Automata in Traffic Problems. ACRI Boris Goldengorin, Alexander Makarenko, Natalia Smelyanec
2006	C	`conf`	Some Basics on Tolerances. AAIM Boris Goldengorin, Gerold Jäger, Paul Molitor
2006	—	`conf`	Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN Boris Goldengorin, Gerold Jäger, Paul Molitor
2006	B	`conf`	Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. WAOA Gregory Z. Gutin, Boris Goldengorin, Jing Huang
2005	J	`jnl`	A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem. J. Glob. Optim. Boris Goldengorin, Diptesh Ghosh
2005	—	`conf`	Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching. WEA Henk Bekker, E. P. Braad, Boris Goldengorin
2005	—	`conf`	Using Bipartite and Multidimensional Matching to Select the Roots of a System of Polynomial Equations. ICCSA (4) Henk Bekker, E. P. Braad, Boris Goldengorin
2004	J	`jnl`	Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
2004	B	`conf`	Tolerance Based Algorithms for the ATSP. WG Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen
2003	J	`jnl`	Branch and peg algorithms for the simple plant location problem. Comput. Oper. Res. Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
2003	J	`jnl`	Solving the Simple Plant Location Problem using a Data Correcting Approach. J. Glob. Optim. Boris Goldengorin, Gert A. Tijssen, Diptesh Ghosh, Gerard Sierksma
2001	—	`conf`	Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. WAE Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
2000	J	`jnl`	Book review: Network Design: Connectivity and Facilities Location. Proceedings from DIMACS workshop in April-1997 (AMS 1998). SIGACT News Boris Goldengorin