Boris Goldengorin

According to our database1, Boris Goldengorin
  • authored at least 44 papers between 2000 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem.
Appl. Soft Comput., 2018

2017
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems.
J. Global Optimization, 2017

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

2015
Preemptive scheduling in a two-stage supply chain to minimize the makespan.
Optimization Methods and Software, 2015

Pareto-optimal front of cell formation problem in group technology.
J. Global Optimization, 2015

A tolerance-based heuristic approach for the weighted independent set problem.
J. Comb. Optim., 2015

2014
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time.
Optimization Methods and Software, 2014

Improvements to MCS algorithm for the maximum clique problem.
J. Comb. Optim., 2014

A backbone based TSP heuristic for large instances.
J. Heuristics, 2014

Network approach for the Russian stock market.
Comput. Manag. Science, 2014

The Theory of Set Tolerances.
Proceedings of the Learning and Intelligent Optimization, 2014

2012
Extremal values of global tolerances in combinatorial optimization with an additive objective function.
J. Global Optimization, 2012

Flexible PMP Approach for Large-Size Cell Formation.
Operations Research, 2012

Lower tolerance-based Branch and Bound algorithms for the ATSP.
Computers & OR, 2012

An exact model for cell formation in group technology.
Comput. Manag. Science, 2012

2011
Complexity evaluation of benchmark instances for the p-median problem.
Mathematical and Computer Modelling, 2011

Optimal supplier choice with discounting.
JORS, 2011

Data aggregation for p-median problems.
J. Comb. Optim., 2011

A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Towards Cellular Automata Football Models with Mentality Accounting.
Proceedings of the Cellular Automata, 2010

2009
Synchronization of Movement for a Large-Scale Crowd.
Proceedings of the Recent Advances in Nonlinear Dynamics and Synchronization: Theory and Applications, 2009

Maximization of submodular functions: Theory and enumeration algorithms.
European Journal of Operational Research, 2009

Empirical evaluation of construction heuristics for the multidimensional assignment problem
CoRR, 2009

Equivalent instances of the simple plant location problem.
Computers & Mathematics with Applications, 2009

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

Tolerance-based Branch and Bound algorithms for the ATSP.
European Journal of Operational Research, 2008

The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.
Algorithmic Operations Research, 2008

Game 'Life' with Anticipation Property.
Proceedings of the Cellular Automata, 2008

2007
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

Optimal Order Allocation with Discount Pricing.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
Iterative patching and the asymmetric traveling salesman problem.
Discrete Optimization, 2006

Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

Some Applications and Prospects of Cellular Automata in Traffic Problems.
Proceedings of the Cellular Automata, 2006

Some Basics on Tolerances.
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.
J. Global Optimization, 2005

Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching.
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.
Proceedings of the Computational Science and Its Applications, 2005

2004
Branch and peg algorithms for the simple plant location problem.
Computers & OR, 2004

Tolerance Based Algorithms for the ATSP.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

2003
Solving the Simple Plant Location Problem using a Data Correcting Approach.
J. Global Optimization, 2003

Branch and peg algorithms for the simple plant location problem.
Computers & OR, 2003

2001
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem.
Proceedings of the Algorithm Engineering, 2001

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


  Loading...