RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2009, Volume 16, Number 3, Pages 47–62 (Mi da573)  

The grouping method for the linear relaxation of 1d cutting stock problem

V. M. Kartak

Ufa State Aviation Technical University, Ufa, Russia

Abstract: We consider the problem of large-dimension linear cutting. This problem could be interpreted as a problem of linear integer programming. Using the proposed grouping method we can get the initial solution for the problem of continuous relaxation. This solution is close to the optimum, which often reducing the time to find optimal solutions. Bibl. 15.

Keywords: linear relaxation, simplex-method, 1d cutting stock problem.

Full text: PDF file (289 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 004
Received: 19.06.2008
Revised: 29.04.2009

Citation: V. M. Kartak, “The grouping method for the linear relaxation of 1d cutting stock problem”, Diskretn. Anal. Issled. Oper., 16:3 (2009), 47–62

Citation in format AMSBIB
\Bibitem{Kar09}
\by V.~M.~Kartak
\paper The grouping method for the linear relaxation of 1d cutting stock problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 3
\pages 47--62
\mathnet{http://mi.mathnet.ru/da573}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2588619}
\zmath{https://zbmath.org/?q=an:1249.90161}


Linking options:
  • http://mi.mathnet.ru/eng/da573
  • http://mi.mathnet.ru/eng/da/v16/i3/p47

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:672
    Full text:151
    References:34
    First page:45

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020