Boris Goldengorin

From MaRDI portal
Person:453632

Available identifiers

zbMath Open goldengorin.boris-iWikidataQ102248710 ScholiaQ102248710MaRDI QIDQ453632

List of research outcomes





PublicationDate of PublicationType
An exact algorithm for the preemptive single machine scheduling of equal-length jobs2022-06-22Paper
Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances2019-07-25Paper
Linear assignment problems in combinatorial optimization2018-10-22Paper
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems2017-08-24Paper
A Pseudo-Boolean Approach to the Market Graph Analysis by Means of the p-Median Model2017-06-26Paper
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times2016-09-13Paper
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem2016-09-13Paper
https://portal.mardi4nfdi.de/entity/Q31780572016-07-08Paper
Preemptive scheduling in a two-stage supply chain to minimize the makespan2015-12-28Paper
Cell formation in industrial engineering. Theory, algorithms and experiments2015-09-28Paper
Data aggregation for \(p\)-median problems2015-08-24Paper
A tolerance-based heuristic approach for the weighted independent set problem2015-02-16Paper
Pareto-optimal front of cell formation problem in group technology2015-01-16Paper
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time2014-10-29Paper
Improvements to MCS algorithm for the maximum clique problem2014-04-08Paper
The computational efficiency of Ji-Lee-Li algorithm for the assignment problem2013-12-11Paper
Efficient computation of tolerances in the weighted independent set problem for trees2013-11-11Paper
An exact model for cell formation in group technology2013-10-21Paper
Flexible PMP Approach for Large-Size Cell Formation2013-01-30Paper
Global tolerances in the problems of combinatorial optimization with an additive objective function2013-01-14Paper
Lower tolerance-based branch and bound algorithms for the ATSP2012-11-15Paper
Extremal values of global tolerances in combinatorial optimization with an additive objective function2012-09-27Paper
Data Correcting Approaches in Combinatorial Optimization2012-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31170852012-02-16Paper
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation2011-09-09Paper
Complexity evaluation of benchmark instances for the \(p\)-median problem2011-08-28Paper
https://portal.mardi4nfdi.de/entity/Q30847972011-03-25Paper
Towards Cellular Automata Football Models with Mentality Accounting2010-10-04Paper
Equivalent instances of the simple plant location problem2010-05-16Paper
Maximization of submodular functions: theory and enumeration algorithms2009-06-30Paper
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems2009-03-31Paper
Tolerance-based Algorithms for the Traveling Salesman Problem2008-12-01Paper
Game ‘Life’ with Anticipation Property2008-11-27Paper
Tolerance-based branch and bound algorithms for the ATSP2008-04-24Paper
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP2008-04-17Paper
Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP2008-04-15Paper
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems2008-02-21Paper
Some Basics on Tolerances2008-01-04Paper
Optimal Order Allocation with Discount Pricing2008-01-04Paper
Iterative patching and the asymmetric traveling salesman problem2006-06-30Paper
The isometries of the cut, metric and hypermetric cones2006-06-26Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Experimental and Efficient Algorithms2005-11-30Paper
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem2005-10-18Paper
Data Correcting Algorithms in Combinatorial Optimization2005-09-28Paper
Branch and peg algorithms for the simple plant location problem2005-02-23Paper
Branch and peg algorithms for the simple plant location problem.2004-02-14Paper
Solving the simple plant location problem using a data correcting approach2003-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44256592003-09-11Paper
https://portal.mardi4nfdi.de/entity/Q47855752003-01-05Paper
The Data-Correcting Algorithm for the Minimization of Supermodular Functions2000-10-25Paper
https://portal.mardi4nfdi.de/entity/Q38158741987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37765151986-01-01Paper
Decomposition of the location problem1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37222531984-01-01Paper
A correcting algorithm for solving allocation type problems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32190341983-01-01Paper
Optimization of parametric series with allowance for cost of obtaining information1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36648331982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36905831982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38983461979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38805981977-01-01Paper

Research outcomes over time

This page was built for person: Boris Goldengorin