The following pages link to Boris I. Goldengorin (Q453632):
Displayed 50 items.
- An exact model for cell formation in group technology (Q373207) (← links)
- Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Pareto-optimal front of cell formation problem in group technology (Q486727) (← links)
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- Cell formation in industrial engineering. Theory, algorithms and experiments (Q498514) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- (Q787869) (redirect page) (← links)
- Optimization of parametric series with allowance for cost of obtaining information (Q787870) (← links)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Solving the simple plant location problem using a data correcting approach (Q1411330) (← links)
- Branch and peg algorithms for the simple plant location problem. (Q1423442) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Branch and peg algorithms for the simple plant location problem (Q1765536) (← links)
- Linear assignment problems in combinatorial optimization (Q1797539) (← links)
- Decomposition of the location problem (Q1819693) (← links)
- Global tolerances in the problems of combinatorial optimization with an additive objective function (Q1930843) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- A correcting algorithm for solving allocation type problems (Q2266669) (← links)
- Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances (Q2315579) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- The isometries of the cut, metric and hypermetric cones (Q2494270) (← links)
- Iterative patching and the asymmetric traveling salesman problem (Q2494813) (← links)
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
- Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
- Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times (Q2820105) (← links)
- (Q2867325) (← links)
- Data Correcting Approaches in Combinatorial Optimization (Q2910841) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
- (Q3084797) (← links)
- A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation (Q3091534) (← links)
- (Q3117085) (← links)
- (Q3178057) (← links)
- (Q3219034) (← links)
- Preemptive scheduling in a two-stage supply chain to minimize the makespan (Q3458814) (← links)
- Game ‘Life’ with Anticipation Property (Q3541746) (← links)
- Tolerance-based Algorithms for the Traveling Salesman Problem (Q3542361) (← links)
- (Q3664833) (← links)
- (Q3690583) (← links)
- (Q3722253) (← links)
- (Q3776515) (← links)
- (Q3815874) (← links)
- (Q3880598) (← links)
- (Q3898346) (← links)
- (Q4425659) (← links)