The following pages link to Vadim G. Timkovsky (Q161994):
Displaying 22 items.
- (Q207392) (redirect page) (← links)
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time (Q706379) (← links)
- Integer programs for margining option portfolios by option spreads with more than four legs (Q744225) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- (Q1278311) (redirect page) (← links)
- Total completion time minimization in two-machine job shops with unit-time operations (Q1278312) (← links)
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem (Q1364482) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- Ideal preemptive schedules on two processors (Q1424363) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems (Q1970336) (← links)
- Some recognition problems related to graph isomorphism (Q3470503) (← links)
- (Q3713852) (← links)
- (Q3734131) (← links)
- (Q3737196) (← links)
- (Q3741392) (← links)
- Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem (Q4007453) (← links)
- String Noninclusion Optimization Problems (Q4210217) (← links)
- (Q4312913) (← links)
- Basket problems in margin calculation: modelling and algorithms. (Q5925945) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)
