Sobolev Institute of Mathematics
Laboratory "Mathematical Models of Decision Making"

Prof. Yuri Kochetov

 

Yuri Kochetov

Publications

Lectures

Conference presentations

Benchmarks library


Publications

2016

  • E.Alekseeva,Y.Kochetov,El-G.Talbi. A matheuristicfor the discrete bi-level problem with multiple objectives at the lower level // J.International Transactions In Operational Research. DOI: 10.1111/itor.12268

  • Čvokić, D.D., Kochetov, Y.A., Plyasunov, A.V. A leader-follower hub location problem under fixed markups // Yu. Kochetov et.al. (Eds.) 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016;  LNCS Vol. 9869. 2016. P. 350-363.  DOI: 10.1007/978-3-319-44914-2_28

2015

  • Alekseeva E., Kochetov Yu., Plyasunov A. An exact method for the discrete (r|p)-centroid problem // Journal of Global Optimization, 2013 DOI: 10.1007/s10898-013-0130-6  (pdf-file 333 Kb)

  • S. Iellamo, E. Alekseeva, L. Chen, M. Coupechoux, Yu. Kochetov. Competitive location in cognitive radio networks // 4OR. 2015. Vol. 13, Issue 1, P. 81-110 DOI: 10.1007/s10288-014-0268-1 (pdf.file 1108 Kb)

  • I. Davydov, Y. Kochetov. VNS-based heuristic with an exponential neighborhood for the server load balancing problem // Electronic Notes in Discrete Mathematics, 2015.Vol. P. 53–60  DOI: 10.1016/j.endm.2014.11.008

  • A. Khmelev, Yu. Kochetov A hybrid VND method for the split delivery vehicle routing problem// Electronic Notes in Discrete Mathematics, 2015.Vol. P. 5–12  DOI: 10.1016/j.endm.2014.11.002

  • Kochetov Yu.A., Panin A.A., Plyasunov A.V. Comparison of metaheuristics for the bilevel facility location and mill pricing problem // Journal of Applied and Industrial Mathematics 2015. Vol. 9, N 3. P 392-401.
    DOI
    10.1134/S1990478915030102 (pdf.file 580 Kb)

  • Kochetov Yu. A., Khmelev A. V. A Hybrid Algorithm of Local Search for the Heterogeneous Fixed Fleet Vehicle Routing Problem// Journal of Applied and Industrial Mathematics, 2015, Vol. 9, No. 4, pp. 503–518.
    DOI:
    10.1134/S1990478915040079 (pdf.file 977 Kb)

  • Khmelev A., Kochetov  Yu. A Hybrid Local Search for the Split Delivery Vehicle Routing Problem // International Journal of Artificial Intelligence. 2015, Vol. 13 No 1 P. 147–164.
     

2014

  • I. Davydov·Yu. Kochetov ·A. Plyasunov On the complexity of the (r|p)-centroid problem in the plane // TOP 2014, Vol. 22, Issue 2, P. 614-623. DOI: 10.1007/s11750-013-0275-y

  • I.A. Davydov,Yu.A.Kochetov, N. Mladenovic,and D.Urosevic. Fast Metaheuristics for the Discrete (r|p)-Centroid Problem // Automation and Remote Control, 2014, Vol. 75, No. 4, pp. 677–687. (pdf-file 174 Kb)

 

2013

  • E. Alekseeva, Yu. Kochetov. Matheuristics and exact methods for the discrete (r|p)-centroid problem In: El-G. Talbi, L.Brotcorne (Eds.) Metaheuristics for Bi-level Optimization (Studies in Computational Intelligence 2013 Volume 482, Pages 189-219).  Springer, 2013 DOI: 10.1007/978-3-642-37838-6-7

  • Davydov I.A., Kochetov Y.A., Carrizosa E. A local search heuristic for the (r|p)-centroid problem in the plane // Computers & Operations Research, 2014, Volume 52,  P.334-340 DOI: 10.1016/j.cor.2013.05.003. (pdf-file 2880 Kb)

  • Kochetov Yu. A., Kochetova N. A. The Servers Load Balancing Problem // Vestnik Novosibirsk State University. Series: Information Technologies 2013. Volume 11, issue 4. P. 71-76. (Russian)

 

2012

  • Z. Diakova, Yu. Kochetov. A double VNS heuristic for the facility location and pricing problem // Electronic Notes in Discrete Mathematics. 2012. Vol. 39. P. 29–34. DOI: 10.1016/j.endm.2012.10.005 (pdf-file 144 Kb)

  • I. Davydov, Yu. Kochetov, E. Carrizosa. VNS heuristic for the (r | p)-centroid problem on the plane // Electronic Notes in Discrete Mathematics. 2012. Vol. 39. P. 5–12 DOI: 10.1016/j.endm.2012.10.002 (pdf-file 319 Kb)

  • P. A. Kononova, Yu.A. Kochetov. Variable neighborhood search for two machine flowshop problem with a passive prefetch // Discrete Analysis and Operations Research. v. 19,N 5. P. 63–82. (Russian. English summary)

  • Kochetov Yu.A. and Plyasunov A.V. Genetic Local Search the Graph Partitioning Problem under Cardinality Constraints // Computational Mathematics and Mathematical Physics. 2012. Vol.52, N 1. P. 157–167.
    DOI: 10.1134/S096554251201006X  (pdf-file 251 Kb)

  • Carrizosa, E., Davydov, I. and Yu. Kochetov. A new alternating heuristic for the (r|p)-centroid problem on the plane // Operations Research Proceedings 2011. Springer, 2012. P. 275-280. (pdf-file 44 Kb)

  • Kochetov, Yu.A.; Sivykh, M.S.; Khmelev, A.V.; Yakovlev, A.V. Methods of local search for a problem on the permutation of the columns of a binary matrix. // Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 12, No. 1, 91-101 (2012). (Russian. English summary)
     

2011

  • Yu. Kochetov. Facility Location: Discrete Models and Local Search Methods // V.Chvatal (Ed.): Combinatorial Optimization. Methods and Applications. IOS Press, Amsterdam, 2011. pp. 97-134. (pdf.file 622 Kb)

  • Yu. Kochetov. Iterative local search methods for the talent scheduling problem // Proceedings of 1st International Symposium &10th Balkan Conference on Operational Research. September 22. 2011. Thessaloniki, Greece P.282-288. (pdf-file 132 Kb)

  • Yu. Kochetov. Bilevel facility location: discrete models and computational methods // Proceedings Of  XXXVII Symposium în Operations Research – (SYMOPIS-2010). 2010. – P 12–16. (pdf.file 131 Kb)

  • Kochetov Y. A. Metaheuristics for a data compression problem  // Proceedings of  Intellectualization of information processing» conference. Cyprus, Paphos, October, 17–24, 2010  – P. 278-281 (pdf.file 246 Kb) (in Russian)

2010

  • E. Alekseeva, N. Kochetova, Y. Kochetov, A. Plyasunov. Heuristic and Exact Methods for the Discrete (r | p)-Centroid Problem // P. Cowling and P. Merz (Eds.): EvoCOP 2010, LNCS 6022, Springer, Heidelberg, 2010. pp. 11-22. DOI: 10.1007/978-3-642-12139-5_2 (pdf.file 184 Kb)

  • Yu. Kochetov. Bilevel facility location: discrete models and computational methods // Proceedings Of  XXXVII Symposium în Operations Research – (SYMOPIS-2010). 2010. – P 12–16. (pdf.file 131 Kb)

2009

  • E. Alekseeva, N. Kochetova, Y. Kochetov, A. Plyasunov. A Hybrid Memetic Algorithm for the Competitive p-Median Problem // Information Control Problems in Manufacturing 2009 Vol. 13. Part 1. P.1995-2000.  (pdf.file 216 Kb)  DOI: 10.3182/20090603-3-RU-2001.00254

  • Kochetov Yu., Mikhailova A., Plyasunov A. A Genetic Local Search Algorithm for the Graph Partitioning Problem with Cardinality Constraints // Information Control Problems in Manufacturing 2009 Vol. 13. Part 1. P.1533-1537.  DOI: 10.3182/20090603-3-RU-2001.00335

  • I.L. Vasil’ev, K.B. Klimentova, and Yu.A. Kochetov. New Lower Bounds for the Facility Location Problem with Clients’ Preferences // Computational Mathematics and Mathematical Physics, 2009, Vol. 49, No. 6, pp. 1010–1020. DOI: 10.1134/S0965542509060098  (pdf.file 178 Kb)

  • A. V. Kononov, Yu. A. Kochetov, and A. V. Plyasunov Competitive Facility Location Models // Computational Mathematics and Mathematical Physics, 2009, Vol. 49, No. 6, pp. 994–1009. DOI: 10.1134/S0965542509060086   (pdf.file 259 Kb)

2008

  • Yu. Kochetov. Nash equilibria in the facility location games // Proceeding of XIV Baikal International School-seminar «Optimization methods and their applications». Irkutsk 2008. P. 119–127. (in Russian)

  • P. Kononova, Yu. Kochetov. On a problem of permutation of the columns for 0-1 matrix // Proceeding of XIV Baikal International School-seminar «Optimization methods and their applications». Irkutsk 2008. P. 444-451 (in Russian)

  • Yu. Kîchetov, P. Kononova, M. Paschenko. Formulation Space Search Approach for the Teacher/Class Timetabling Problem // Yugoslav Journal of Operations Research 18 (2008), Number 1. (pdf.file 194 Kb)

  • E. Alekseeva, Yu. Kochetov, A. Plyasunov. Complexity of local search for the p-median problem // European Journal of Operational Research 191 (2008) 736–752. (pdf.file 595 Kb)

  • Yu. A. Kochetov. Computational Capabilities of Local Search in Combinatorial Optimization // Computational Mathematics and Mathematical Physics, 2008, Vol. 48, No. 5, p. 788–807. (pdf-file 145 Kb)

 2007

  • E. Alekseeva, Yu. Kochetov. Genetic local search for the p-median problem with user preferences // Discrete Analysis and Operations Research, Series 2, 2007 V.14, N 1, P. 3-31. (In Russian).  

 2006

  • Yu. Kochetov, P. Obuhovskaya, M. Paschenko.  Local Search Heuristics for the Teacher\Class Timetabling Problem.  Proceedings of 6th International conference on the Practice and Theory of Automated Timetabling (PATAT-2006). Brno, The Chech Republic. 2006. P. 454-457 (pdf-file 547 Kb)

  • Bert Beisiegel and J. Kallrath and Yuri Kochetov and Anton Rudnev. Simulated Annealing Based Algorithm for the 2D Bin Packing Problem with Impurities // Operations Research Proceedings-2005. Springer. Heidelberg. 2006. P. 309-314. (pdf-file 48 Kb)

2005

  • Yu. Velikanova, Yu. Kochetov. Variable neighborhood search for the 2D orthogonal packing // Proceedings of 18th Mini Euro Conference on VNS. 2005. (pdf-file 139 Kb)

  • E. Alekseeva, Yu. Kochetov, A. Plyasunov. Complexity of local search for the p-median problem // Proceedings of 18th Mini Euro Conference on VNS. 2005. (pgf-file 248 Kb)

  • Yu. Kochetov, A. Pljasunov, M. Pashchenko.  On complexity of local search for the p-median problem // Discrete Analysis and Operations Research, Series 2, 2005 V.12, N 2, P. 44-71. (In Russian).

  • Yu. Kochetov, D. Ivanenko. Computationally difficult instances for the uncapacitated facility location problem. In: T. Ibaraki et al. (eds.) Metaheuristics: progress as real solvers, Springer, 2005, P. 351-367.  

  • V. Ishutenko, Yu. Kochetov. Mathematical Model to Evaluate the Composition of a Technical Tool System // Proceeding of 13-th Baikal international School-seminar. V.1 Mathematical programming. Irkutsk. 2005. p. 497-502. (in Russian). 

  • E. Alekseeva, Yu. Kochetov, N. Kochetova. Crucial Parameters for the Uncapacitated Facility Location Problem // Proceeding of 13-th Baikal international School-seminar. V.1 Mathematical programming. Irkutsk. 2005. p. 407-412. (in Russian). 

  • Yu. Kochetov, A. Pljasunov. Local Search in Combinatorial Optimization. What About the Derivative? // Proceeding of 13-th Baikal international School-seminar. V.1 Mathematical programming. Irkutsk. 2005. p. 65-75. (in Russian).

  • Yu. Kochetov, E. Alekseeva T. Levanova, M. Loresh Large neighborhood local search for the p-median problem // Yugoslav Journal of Operations Research.  2005. Volume 15 (1). P. 53-63. 

  • Yu. Kochetov, A. Stolyar. New Greedy Euristics for the the Resource Constrained Project Scheduling Problem // Discrete Analysis and Operations Research, series 2,  2005, Òîì 12,(1). P 12–36. (in Russian).

2004

  • Hansen P., Kochetov Yu., Mladenovic N. Lower bounds for the uncapasitated facility location problem with user preferences // Preprint G-2004-24, Mart 2004, GTRAD–HEC, Montreal, Canada, 10 P.  

  • Y. Kochetov, A. Stolyar  A Probabilistic Multi-Pass Heuristic for the Resource Constrained Project Scheduling Problem // 9-th International Workshop on Project Management and Scheduling PMS-2004, April 26-28 2004, Nancy, France. P. 319–322. 

  • Hansen P., Kochetov Yu., Mladenovic N.  Lower bounds for the uncapasitated facility location problem with user preferences // Discrete Optimization Methods in Production and Logistics (DOM’2004) 2nd International Workshop, Omsk . 2004. P.50–55.  

  • Kochetov Yu., Stolyar A. A GRASP approach to the resource constrained project scheduling problem // Discrete Optimization Methods in Production and Logistics (DOM’2004) 2-nd International Workshop, Omsk . 2004. P.131–136.  

2003

  • Yu.Kochetov and E.Alexeeva. Large Neighborhood Search for the p-Median Problem. // Proceedings SYM-OP-IS 2003, Herceg-Novi, Montenegro, 2003, (pdf.file 103 Kb)  

  • Yu.Kochetov and D. Ivanenko. Computationally Difficult Instancesfor the Uncapacitated Facilitu Location Problem // Proceedings MIC’2003, Kioto, 2003. (ps.file 122 Kb)

  • Yu.Kochetov and A. Stolyar. Evolutionary Local Search with Variable Neighborhood for the Resource Constrained Project Scheduling Problem.// Proceeding of Workshop on Computer Science and Information Technologies CSIT’2003, 2003. (pdf.file 70 Kb)

  • Yu.Kochetov, N. Mladenovic, and P. Hansen. Variable Neighborhood Search. Discrete Analysis and Operations Research, series 2, 10(1), 2003, 11-43 (in Russian).(ps.file 556 Kb)

2002

  • Yu.Kochetov and A.Plyasunov. The Uncapacitated Facility Location Problem with Partial External Finance. Discrete Analysis and Operations Research, series 2, 9(2), 2002, 78-96 (in Russian).

  • E.Goncharov and Yu.Kochetov. Probabilistic Tabu Search for the Unconstrained Discrete Optimization Problems. Discrete Analysis and Operations Research, series 2, 9(2), 2002, 13–30 (in Russian).

2001

  • Yu.Kochetov and A. Usmanova. Probabilistic Tabu Search with Exponential Neighborhood for Bin Packing Problem, Proceedings MIC’2001, Porto, 2001, 619-624.

  • E.Goncharov, D.Ivanenko, Yu.Kochetov, and N.Kochetova Benchmark Library: Discrete Location Problems. Proceedings of 12-th Baikal International Conference, Irkutsk, 2001, v 1, 132-137 (in Russian).

  • E.Goncharov and Yu.Kochetov, Probabilistic Tabu Search Algorithm for the Multi-Stage Uncapacitated Facility Location Problem  In: Operations Research Proceedings 2000, Springer, 65-70 (doc-file 125 Kbpdf-file 35 Kb )

  • Yu.Kochetov, Probabilistic Local Search Algorithms for the Discrete Optimization Problems, Discrete Mathematics and Applications, Moscow, MSU, 2001, 84-117 (in Russian) (ps.file 586 Kb)

2000

  • N.Glebov, Yu.Kochetov, and A.Plyasunov, Optimization Methods, Novosibirsk, NSU, 2000 (in Russian)

  • E.Goncharov and Yu.Kochetov,  Behavior of a Probabilistic Tabu Search Algorithm for the Multi Stage Uncapacitated Facility Location Problem, Proceedings INFORMS-KORMS, Seoul 2000 (doc-file 90 Kb)

1996--1999

  • E.Goncharov and Yu.Kochetov, Behavior of the Probabilistic Greedy Algorithms for the Multistage Uncapacitated Facility Location Problem, Discrete Analysis and Operations Research, series 2, 6(1), 1999, 12-32 (in Russian).

  •  D.Alexandrov and Yu.Kochetov, The Behavior of Ant Colony Algorithm for the Set Covering Problem.  In: Operations Research Proceedings 1999, Springer, 255-260.

  • E.Goncharov and Yu.Kochetov, A Probabilistic Greedy Algorithm with Branching for the Multistage Allocation Problem, Proceedings of 11-th Baikal International School-Seminar, Irkutsk, 1998, 121-124 (in Russian).

  • L.Gorbachevskaya and Yu.Kochetov, Probabilistic Heuristic for the Two-Level Allocation Problem, Proceedings of 11-th Baikal International School-Seminar, Irkutsk, 1998, 249-252 (in Russian).

  • Yu. Kochetov and A.Pljasunov, A Polynomially Solvable Case for the Bilevel Linear Programming Problems. Discrete Analysis and Operations Research, series 2, 4(2), 1997, 23-33, (in Russian).

  • Yu. Kochetov and D.Alexandrov, The Simple Plant Location Problem with Partial External Finance: Lower Bound, Heuristic and Exact Solution. In: Operations Research Proceedings 1996, Springer, 90-94.

  • Yu. Kochetov and A.Pljasunov, Efficient Algorithm for a Class of Bilevel Linear Programming Problems. In: Operations Research Proceedings 1996, Springer, 10-13.


Update 24.10.16