Vladimir Kotov

21 papers B 1Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2018 J jnl
General parametric scheme for the online uniform machine scheduling problem with two different speeds.
Inf. Process. Lett.
Alexandre Dolgui, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot
2017 J jnl
Improved lower bounds for the online bin stretching problem.
4OR
Michaël Gabay, Nadia Brauner, Vladimir Kotov
2015 J jnl
An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.
J. Sched.
Hans Kellerer, Vladimir Kotov, Michaël Gabay
2015 J jnl
Online bin stretching with bunch techniques.
Theor. Comput. Sci.
Michaël Gabay, Vladimir Kotov, Nadia Brauner
2013 J jnl
An efficient algorithm for bin stretching.
Oper. Res. Lett.
Hans Kellerer, Vladimir Kotov
2012 J jnl
Algorithms better than LPT for semi-online scheduling with decreasing processing times.
Oper. Res. Lett.
T. C. E. Cheng, Hans Kellerer, Vladimir Kotov
2011 J jnl
A 3/2-approximation algorithm for 3/2-partitioning.
Oper. Res. Lett.
Hans Kellerer, Vladimir Kotov
2011 — conf
A best-fit heuristic algorithm for two-dimensional bin packing problem.
EMEIT
Dayong Cao, Vladimir Kotov
2010 J jnl
Reuse in Software Development Organizations in Latvia.
Sci. J. Riga Tech. Univ. Ser. Comput. Sci.
Vladimir Kotov
2009 J jnl
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math.
C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov
2008 J jnl
Batch scheduling of step deteriorating jobs.
J. Sched.
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov
2006 J jnl
A new algorithm for online uniform-machine scheduling to minimize the makespan.
Inf. Process. Lett.
T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
2005 J jnl
Semi-on-line multiprocessor scheduling with given total processing time.
Theor. Comput. Sci.
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
2004 J jnl
Algorithms for on-line bin-packing problems with cardinality constraints.
Discret. Appl. Math.
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
2003 J jnl
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
Oper. Res. Lett.
Hans Kellerer, Vladimir Kotov
2003 J jnl
Lower Bounds and Semi On-line Multiprocessor Scheduling.
Comput. Sci. J. Moldova
T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
2001 B conf
On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
ISAAC
Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov
1998 J jnl
The
Math. Methods Oper. Res.
Luitpold Babel, Hans Kellerer, Vladimir Kotov
1998 J jnl
The Stock Size Problem.
Oper. Res.
Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger
1997 J jnl
Semi on-line algorithms for the partition problem.
Oper. Res. Lett.
Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
1996 J jnl
Maximum travelling salesman problem.
Math. Methods Oper. Res.
Vladimir Kotov, Michail M. Kovalev