EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"dynamic programming recursion"
Narrow search

Narrow search

Year of publication
Subject
All
dynamic programming recursion 2 homogenous strip 2 two-dimensional layout 2 Algorithm 1 Algorithmus 1 Dynamic programming 1 Dynamische Optimierung 1 Mathematical programming 1 Mathematische Optimierung 1 Theorie 1 Theory 1
more ... less ...
Online availability
All
Free 2
Type of publication
All
Article 2
Type of publication (narrower categories)
All
Article 1 Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
English 2
Author
All
Cui, Yao-Dong 2 Du, Jun 2 Ji, Jun 2 Shi, Ning 2 Xing, Fei-Fei 2
Published in...
All
Journal of Industrial Engineering and Management (JIEM) 1 Journal of industrial engineering and management : JIEM 1
Source
All
ECONIS (ZBW) 1 EconStor 1
Showing 1 - 2 of 2
Cover Image
A deterministic algorithm for generating optimal three-stage layouts of homogenous strip pieces
Ji, Jun; Xing, Fei-Fei; Du, Jun; Shi, Ning; Cui, Yao-Dong - In: Journal of Industrial Engineering and Management (JIEM) 7 (2014) 5, pp. 1167-1182
Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. Design/methodology/approach: The algorithm uses the dynamic programming algorithm...
Persistent link: https://www.econbiz.de/10011939166
Saved in:
Cover Image
A deterministic algorithm for generating optimal three-stage layouts of homogenous strip pieces
Ji, Jun; Xing, Fei-Fei; Du, Jun; Shi, Ning; Cui, Yao-Dong - In: Journal of industrial engineering and management : JIEM 7 (2014) 5, pp. 1167-1182
Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. Design/methodology/approach: The algorithm uses the dynamic programming algorithm...
Persistent link: https://www.econbiz.de/10011913038
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...