Boris Goldengorin

2008
16	EE	Alexander Makarenko, Boris Goldengorin, Dmitry Krushinsky: Game 'Life' with Anticipation Property. ACRI 2008: 77-82
15	EE	Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma: Tolerance-based Branch and Bound algorithms for the ATSP. European Journal of Operational Research 189(3): 775-788 (2008)
14	EE	Gregory 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)
2007
13	EE	Boris Goldengorin, John Keane, Viktor Kuzmenko, Michael Tso: Optimal Order Allocation with Discount Pricing. AAIM 2007: 273-284
12	EE	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
11	EE	Boris Goldengorin, Gerold Jäger, Paul Molitor: Some Basics on Tolerances. AAIM 2006: 194-206
10	EE	Boris Goldengorin, Alexander Makarenko, Natalia Smelyanec: Some Applications and Prospects of Cellular Automata in Traffic Problems. ACRI 2006: 532-537
9	EE	Boris Goldengorin, Gerold Jäger, Paul Molitor: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. CAAN 2006: 86-97
8	EE	Gregory 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
7	EE	Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma: Iterative patching and the asymmetric traveling salesman problem. Discrete Optimization 3(1): 63-77 (2006)
2005
6	EE	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: 397-406
5	EE	H. 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
4	EE	Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen: Tolerance Based Algorithms for the ATSP. WG 2004: 222-234
3	EE	Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma: Branch and peg algorithms for the simple plant location problem. Computers & OR 31(2): 241-255 (2004)
2003
2	EE	Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma: Branch and peg algorithms for the simple plant location problem. Computers & OR 30(7): 967-981 (2003)
2001
1	EE	Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma: Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem. Algorithm Engineering 2001: 106-117

Coauthor Index

1	H. Bekker	[5] [6]
2	E. P. Braad	[5] [6]
3	Diptesh Ghosh	[1] [2] [3] [7] [15]
4	Gregory Gutin	[8] [14]
5	Jing Huang	[8] [14]
6	Gerold Jäger	[9] [11] [12]
7	John Keane	[13]
8	Dmitry Krushinsky	[16]
9	Viktor Kuzmenko	[13]
10	Alexander Makarenko	[10] [16]
11	Paul Molitor	[9] [11] [12]
12	Dirk Richter	[12]
13	Gerard Sierksma	[1] [2] [3] [4] [7] [15]
14	Natalia Smelyanec	[10]
15	Michael Tso	[13]
16	Marcel Turkensteen	[4] [7] [15]

Colors in the list of coauthors