Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2012, Issue 2, Pages 126–140 (Mi at3616)  
This article is cited in 1 scientific paper (total in 1 paper)

Integer Programming Problems

Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route

E. Kh. Gimadia, A. V. Shakhshneyderb

a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Technical University of Munich, Munich, Germany
Full-text PDF (284 kB) Citations (1)
References:
PDF
HTML
Abstract: We propose approximate algorithms for routing problems with a bounded number of clients on each route ($k$-VRP and Multi-Depot $k$-VRP). We derive estimates of the algorithms' quality and conditions for their asymptotic exactness in the case of a complete graph in which the weights of the edges (arcs) are independent random variables with a common distribution function.
Presented by the member of Editorial Board: A. I. Kibzun

Received: 06.06.2011
English version:
Automation and Remote Control, 2012, Volume 73, Issue 2, Pages 323–335
DOI: https://doi.org/10.1134/S0005117912020105
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: E. Kh. Gimadi, A. V. Shakhshneyder, “Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route”, Avtomat. i Telemekh., 2012, no. 2, 126–140; Autom. Remote Control, 73:2 (2012), 323–335
Citation in format AMSBIB
\Bibitem{GimSha12}
\by E.~Kh.~Gimadi, A.~V.~Shakhshneyder
\paper Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
\jour Avtomat. i Telemekh.
\yr 2012
\issue 2
\pages 126--140
\mathnet{http://mi.mathnet.ru/at3616}
\transl
\jour Autom. Remote Control
\yr 2012
\vol 73
\issue 2
\pages 323--335
\crossref{https://doi.org/10.1134/S0005117912020105}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000300280000010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84862135738}
Linking options:
  • https://www.mathnet.ru/eng/at3616
  • https://www.mathnet.ru/eng/at/y2012/i2/p126
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:531
    Full-text PDF :103
    References:60
    First page:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024