Vadim G. Timkovsky

MaRDI QIDQ161994zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Integer programs for margining option portfolios by option spreads with more than four legs Computational Management Science	2014-10-06	Paper
The bipartite margin shop and maximum red matchings free of blue-red alternating cycles Discrete Optimization	2009-08-19	Paper
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time Mathematical Methods of Operations Research	2005-02-08	Paper
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time 4OR	2004-10-28	Paper
Ideal preemptive schedules on two processors Acta Informatica	2004-03-11	Paper
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity European Journal of Operational Research	2003-07-30	Paper
On scheduling cycle shops: Classification, complexity and approximation Journal of Scheduling	2003-07-27	Paper
On preemption redundancy in scheduling unit processing time jobs on two parallel machines Operations Research Letters	2002-09-22	Paper
Basket problems in margin calculation: modelling and algorithms. European Journal of Operational Research	2001-07-05	Paper
Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems Journal of Combinatorial Optimization	2000-03-19	Paper
Total completion time minimization in two-machine job shops with unit-time operations European Journal of Operational Research	1999-02-22	Paper
String Noninclusion Optimization Problems SIAM Journal on Discrete Mathematics	1998-09-21	Paper
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem Discrete Applied Mathematics	1997-09-04	Paper
scientific article; zbMATH DE number 686764 (Why is no real title available?)	1994-11-09	Paper
Decidable, polynomial-time, and np-complete cases of the isotone bipartite graph problem Cybernetics	1992-09-27	Paper
Some recognition problems related to graph isomorphism Cybernetics	1988-01-01	Paper
scientific article; zbMATH DE number 3965778 (Why is no real title available?)	1986-01-01	Paper
scientific article; zbMATH DE number 3970499 (Why is no real title available?)	1985-01-01	Paper
scientific article; zbMATH DE number 3941255 (Why is no real title available?)	1985-01-01	Paper
scientific article; zbMATH DE number 3976753 (Why is no real title available?)	1983-01-01	Paper

Research outcomes over time

This page was built for person: Vadim G. Timkovsky