The following pages link to Mikhail Batsyn (Q281814):
Displayed 19 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- Exact model for the cell formation problem (Q479245) (← links)
- (Q647773) (redirect page) (← links)
- Power index axiomatics in the problem of voting with quota (Q647775) (← links)
- An efficient exact model for the cell formation problem with a variable number of production cells (Q1652544) (← links)
- Branch-and-bound algorithm for Symmetric Travelling Salesman problem (Q1671016) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← 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)
- Heuristic Algorithm for the Cell Formation Problem (Q2820107) (← links)
- Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← links)
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062) (← links)
- A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem (Q3133219) (← links)
- Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem (Q3133351) (← links)
- (Q4640250) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
- Comparison of robustness of statistical procedures for network structure analysis (Q6297103) (← links)