Vladimir Kotov

According to our database, Vladimir Kotov authored at least 21 papers between 1996 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

General parametric scheme for the online uniform machine scheduling problem with two different speeds.

Alexandre Dolgui, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot

Inf. Process. Lett., 2018

2017

Improved lower bounds for the online bin stretching problem.

Michaël Gabay, Nadia Brauner, Vladimir Kotov

4OR, 2017

2015

Online bin stretching with bunch techniques.

Michaël Gabay, Vladimir Kotov, Nadia Brauner

Theor. Comput. Sci., 2015

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.

Hans Kellerer, Vladimir Kotov, Michaël Gabay

J. Sched., 2015

2013

An efficient algorithm for bin stretching.

Hans Kellerer, Vladimir Kotov

Oper. Res. Lett., 2013

2012

Algorithms better than LPT for semi-online scheduling with decreasing processing times.

T. C. E. Cheng, Hans Kellerer, Vladimir Kotov

Oper. Res. Lett., 2012

2011

A 3/2-approximation algorithm for 3/2-partitioning.

Hans Kellerer, Vladimir Kotov

Oper. Res. Lett., 2011

A best-fit heuristic algorithm for two-dimensional bin packing problem.

Dayong Cao, Vladimir Kotov

Proceedings of the International Conference on Electronic and Mechanical Engineering and Information Technology, 2011

2010

Reuse in Software Development Organizations in Latvia.

Vladimir Kotov

Sci. J. Riga Tech. Univ. Ser. Comput. Sci., 2010

2009

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.

C. T. Ng, T. C. Edwin Cheng, Vladimir Kotov, Mikhail Y. Kovalyov

Discret. Appl. Math., 2009

2008

Batch scheduling of step deteriorating jobs.

M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov, Mikhail Y. Kovalyov

J. Sched., 2008

2006

A new algorithm for online uniform-machine scheduling to minimize the makespan.

T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov

Inf. Process. Lett., 2006

2005

Semi-on-line multiprocessor scheduling with given total processing time.

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov

Theor. Comput. Sci., 2005

2004

Algorithms for on-line bin-packing problems with cardinality constraints.

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov

Discret. Appl. Math., 2004

2003

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.

Hans Kellerer, Vladimir Kotov

Oper. Res. Lett., 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.

T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov

Comput. Sci. J. Moldova, 2003

2001

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.

Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998

The<i>k</i>-partitioning problem.

Luitpold Babel, Hans Kellerer, Vladimir Kotov

Math. Methods Oper. Res., 1998

The Stock Size Problem.

Hans Kellerer, Vladimir Kotov, Franz Rendl, Gerhard J. Woeginger

Oper. Res., 1998

1997

Semi on-line algorithms for the partition problem.

Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza

Oper. Res. Lett., 1997

1996

Maximum travelling salesman problem.

Vladimir Kotov, Michail M. Kovalev

Math. Methods Oper. Res., 1996