 | 2012 |
| 28 |  | Remco Germs,
Boris Goldengorin,
Marcel Turkensteen:
Lower tolerance-based Branch and Bound algorithms for the ATSP.
Computers & OR 39(2): 291-298 (2012) |
| 2011 |
| 27 |  | 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 |
| 26 |  | Bader F. AlBdaiwi,
Diptesh Ghosh,
Boris Goldengorin:
Data aggregation for p-median problems.
J. Comb. Optim. 21(3): 348-363 (2011) |
| 25 |  | Boris Goldengorin,
John A. Keane,
Viktor Kuzmenko,
Michael Tso:
Optimal supplier choice with discounting.
JORS 62(4): 690-699 (2011) |
| 24 |  | Boris Goldengorin,
Dmitry Krushinsky:
Complexity evaluation of benchmark instances for the p-median problem.
Mathematical and Computer Modelling 53(9-10): 1719-1736 (2011) |
| 2010 |
| 23 |  | Alexander Makarenko,
Dmitriy Krushinski,
Anton Musienko,
Boris Goldengorin:
Towards Cellular Automata Football Models with Mentality Accounting.
ACRI 2010: 149-152 |
| 2009 |
| 22 |  | Boris Goldengorin,
Dmitry Krushinsky,
Alexander Makarenko:
Synchronization of Movement for a Large-Scale Crowd.
Recent Advances in Nonlinear Dynamics and Synchronization 2009: 277-303 |
| 21 |  | Daniel Karapetyan,
Gregory Gutin,
Boris Goldengorin:
Empirical evaluation of construction heuristics for the multidimensional assignment problem
CoRR abs/0906.2960: (2009) |
| 20 |  | Bader F. AlBdaiwi,
Boris Goldengorin,
Gerard Sierksma:
Equivalent instances of the simple plant location problem.
Computers & Mathematics with Applications 57(5): 812-820 (2009) |
| 19 |  | Boris Goldengorin:
Maximization of submodular functions: Theory and enumeration algorithms.
European Journal of Operational Research 198(1): 102-112 (2009) |
| 2008 |
| 18 |  | Alexander Makarenko,
Boris Goldengorin,
Dmitry Krushinsky:
Game 'Life' with Anticipation Property.
ACRI 2008: 77-82 |
| 17 |  | Boris Goldengorin,
Gerold Jäger:
The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.
Algorithmic Operations Research 3(1): (2008) |
| 16 |  | 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) |
| 15 |  | 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 |
| 14 |  | Boris Goldengorin,
John A. Keane,
Viktor Kuzmenko,
Michael Tso:
Optimal Order Allocation with Discount Pricing.
AAIM 2007: 273-284 |
| 13 |  | 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 |
| 12 |  | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Some Basics on Tolerances.
AAIM 2006: 194-206 |
| 11 |  | Boris Goldengorin,
Alexander Makarenko,
Natalia Smelyanec:
Some Applications and Prospects of Cellular Automata in Traffic Problems.
ACRI 2006: 532-537 |
| 10 |  | Boris Goldengorin,
Gerold Jäger,
Paul Molitor:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
CAAN 2006: 86-97 |
| 9 |  | 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 |
| 8 |  | Marcel Turkensteen,
Diptesh Ghosh,
Boris Goldengorin,
Gerard Sierksma:
Iterative patching and the asymmetric traveling salesman problem.
Discrete Optimization 3(1): 63-77 (2006) |
| 2005 |
| 7 |  | 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 |
| 6 |  | 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 |
| 5 |  | Boris Goldengorin,
Gerard Sierksma,
Marcel Turkensteen:
Tolerance Based Algorithms for the ATSP.
WG 2004: 222-234 |
| 4 |  | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 31(2): 241-255 (2004) |
| 2003 |
| 3 |  | Boris Goldengorin,
Diptesh Ghosh,
Gerard Sierksma:
Branch and peg algorithms for the simple plant location problem.
Computers & OR 30(7): 967-981 (2003) |
| 2001 |
| 2 |  | 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 |
| 2000 |
| 1 |  | 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) |