Vladimir Kotov

Orcid: 0000-0002-1022-875X

Affiliations:
  • Belarusian State University, Minsk


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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
General parametric scheme for the online uniform machine scheduling problem with two different speeds.
Inf. Process. Lett., 2018

2017
Improved lower bounds for the online bin stretching problem.
4OR, 2017

2015
Online bin stretching with bunch techniques.
Theor. Comput. Sci., 2015

An efficient algorithm for semi-online multiprocessor scheduling with given total processing time.
J. Sched., 2015

2013
An efficient algorithm for bin stretching.
Oper. Res. Lett., 2013

2012
Algorithms better than LPT for semi-online scheduling with decreasing processing times.
Oper. Res. Lett., 2012

2011
A 3/2-approximation algorithm for 3/2-partitioning.
Oper. Res. Lett., 2011

A best-fit heuristic algorithm for two-dimensional bin packing problem.
Proceedings of the International Conference on Electronic and Mechanical Engineering and Information Technology, 2011

2010
Reuse in Software Development Organizations in Latvia.
Sci. J. Riga Tech. Univ. Ser. Comput. Sci., 2010

2009
The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications.
Discret. Appl. Math., 2009

2008
Batch scheduling of step deteriorating jobs.
J. Sched., 2008

2006
A new algorithm for online uniform-machine scheduling to minimize the makespan.
Inf. Process. Lett., 2006

2005
Semi-on-line multiprocessor scheduling with given total processing time.
Theor. Comput. Sci., 2005

2004
Algorithms for on-line bin-packing problems with cardinality constraints.
Discret. Appl. Math., 2004

2003
An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing.
Oper. Res. Lett., 2003

Lower Bounds and Semi On-line Multiprocessor Scheduling.
Comput. Sci. J. Moldova, 2003

2001
On-Line Algorithms for Cardinality Constrained Bin Packing Problems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1998
The<i>k</i>-partitioning problem.
Math. Methods Oper. Res., 1998

The Stock Size Problem.
Oper. Res., 1998

1997
Semi on-line algorithms for the partition problem.
Oper. Res. Lett., 1997

1996
Maximum travelling salesman problem.
Math. Methods Oper. Res., 1996


  Loading...