A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- Author
- YAODONG CUI1 ; YULI YANG1 ; XIAN CHENG1 ; PEIHUA SONG1
[1] Department of Computer Science, Guangxi Normal University, Guilin 541004, China - Source
Computers & operations research. 2008, Vol 35, Num 4, pp 1281-1291, 11 p ; ref : 22 ref
- CODEN
- CMORAP
- ISSN
- 0305-0548
- Scientific domain
- Control theory, operational research; Computer science
- Publisher
- Elsevier Science, Oxford
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- Branch and bound Cutting stock Recursive algorithm Strip packing
- Keyword (fr)
- Algorithme récursif Borne inférieure Borne supérieure Filtrage Méthode heuristique Méthode récursive Méthode séparation et évaluation Plaque Problème découpe Problème remplissage Ramification
- Keyword (en)
- Recursive algorithm Lower bound Upper bound Filtering Heuristic method Recursive method Branch and bound method Plate Cutting stock problem Bin packing problem Branching
- Keyword (es)
- Algoritmo recursivo Cota inferior Cota superior Filtrado Método heurístico Método recursivo Método branch and bound Placa Problema troquelado Problema relleno Ramificación
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 20005474
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.cor.2006.08.011 
https://dx.doi.org/10.1016/j.cor.2006.08.011
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:9:\"\u0000*\u0000jtitle\";s:31:\"Computers & operations research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"35\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:4:\"1281\";s:8:\"\u0000*\u0000epage\";s:4:\"1291\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0548\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YAODONG CUI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:9:\"YULI YANG\";i:1;s:10:\"XIAN CHENG\";i:2;s:11:\"PEIHUA SONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMORAP\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"11\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:9:\"\u0000*\u0000jtitle\";s:31:\"Computers & operations research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"35\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:4:\"1281\";s:8:\"\u0000*\u0000epage\";s:4:\"1291\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0548\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YAODONG CUI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:9:\"YULI YANG\";i:1;s:10:\"XIAN CHENG\";i:2;s:11:\"PEIHUA SONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMORAP\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"11\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:9:\"\u0000*\u0000jtitle\";s:31:\"Computers & operations research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"35\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:4:\"1281\";s:8:\"\u0000*\u0000epage\";s:4:\"1291\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0548\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YAODONG CUI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:9:\"YULI YANG\";i:1;s:10:\"XIAN CHENG\";i:2;s:11:\"PEIHUA SONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMORAP\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"11\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:9:\"\u0000*\u0000jtitle\";s:31:\"Computers & operations research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"35\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:4:\"1281\";s:8:\"\u0000*\u0000epage\";s:4:\"1291\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0548\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YAODONG CUI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:9:\"YULI YANG\";i:1;s:10:\"XIAN CHENG\";i:2;s:11:\"PEIHUA SONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMORAP\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"11\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cor.2006.08.011\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:9:\"\u0000*\u0000jtitle\";s:31:\"Computers & operations research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Comput. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:2:\"35\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:4:\"1281\";s:8:\"\u0000*\u0000epage\";s:4:\"1291\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0305-0548\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:11:\"YAODONG CUI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:9:\"YULI YANG\";i:1;s:10:\"XIAN CHENG\";i:2;s:11:\"PEIHUA SONG\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMORAP\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:91:\"A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem\";s:8:\"\u0000*\u0000place\";s:6:\"Oxford\";s:6:\"\u0000*\u0000pub\";s:16:\"Elsevier Science\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"11\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
