Goldengorin Boris

Boris Goldengorin

Information about the author Boris Goldengorin will soon be added to the site.
Found 9 papers in total
An exact model for cell formation in group technology
An exact model for cell formation in group technology
2012
Despite the long history of the cell formation problem (CF) and availability of dozens...
Lower tolerance‐based Branch and Bound algorithms for the ATSP
Lower tolerance‐based Branch and Bound algorithms for the ATSP
2012
In this paper, we develop a new tolerance‐based Branch and Bound algorithm for...
Data aggregation for p‐median problems
Data aggregation for p‐median problems
2011
In this paper, we use a pseudo‐Boolean formulation of the p ‐median...
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems
2008
Optimization heuristics are often compared with each other to determine which one...
The computational efficiency of Ji–Lee–Li algorithm for the assignment problem
The computational efficiency of Ji–Lee–Li algorithm for the assignment problem
2008
Ji et al. have conjectured that using the matrix form (to represent a basic solution)...
Iterative patching and the asymmetric traveling salesman problem
Iterative patching and the asymmetric traveling salesman problem
2006
Although Branch-and-Bound (BnB) methods are among the most widely used techniques for...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2004
The simple plant location problem is a well-suited problem in combinatorial...
Branch and peg algorithms for the simple plant location problem
Branch and peg algorithms for the simple plant location problem
2003
The simple plant location problem is a well-studied problem in combinatorial...
The data-correcting algorithm for the minimization of supermodular functions
The data-correcting algorithm for the minimization of supermodular functions
1999
The Data-Covering (DC) Algorithm is a recursive branch-and-bound type algorithm, in...
Papers per page: