Advanced search
Publication Cover
Journal of the Operational Research Society Volume 65, 2014 - Issue 11
Submit an article Journal homepage
121
Views
18
CrossRef citations to date
0
Altmetric
General Paper

MIP models for two-dimensional non-guillotine cutting problems with usable leftovers

Ricardo AndradeUniversity of São PauloSão PauloBrazil
,
Ernesto G BirginUniversity of São PauloSão PauloBrazilCorrespondence[email protected]
,
Reinaldo MorabitoFederal University of São CarlosSão CarlosBrazil
&
Débora P RonconiUniversity of São PauloSão PauloBrazil
Pages 1649-1663 | Received 19 Dec 2012, Accepted 25 Jul 2013, Published online: 21 Dec 2017

References

  • AbuabaraAMorabitoRCutting optimization of structural tubes to build agricultural light aircraftsAnnals of Operations Research2009169114916510.1007/s10479-008-0438-7
  • AndradeRBirginEGSymmetry-breaking constraints for packing identical orthogonal rectangles within polyhedraOptimization Letters20137237540510.1007/s11590-011-0425-9
  • BeasleyJEAn exact two-dimensional non-guillotine cutting tree search procedureOperations Research1985331496410.1287/opre.33.1.49
  • BeasleyJEA population heuristic for constrained two-dimensional non-guillotine cuttingEuropean Journal of Operational Research2004156360162710.1016/S0377-2217(03)00139-5
  • BirginEGLobatoRDMorabitoRAn effective recursive partitioning approach for the packing of identical rectangles in a rectangleJournal of the Operational Research Society201061230632010.1057/jors.2008.141
  • BirginEGLobatoRDMorabitoRGenerating unconstrained two-dimensional non-guillotine cutting patterns by a recursive partitioning algorithmJournal of the Operational Research Society201263218320010.1057/jors.2011.6
  • BoschettiMAMingozziAHadjiconstantinouENew upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problemIMA Journal of Management Mathematics20021329511910.1093/imaman/13.2.95
  • BrownAROptimal Packing and Depletion1971
  • ChenCSLeeSMShenQSAn analytical model for the container loading problemEuropean Journal of Operational Research1995801687610.1016/0377-2217(94)00002-T
  • CherriACArenalesMNYanasseHHThe usable leftover one-dimensional cutting stock problem—a priority-in-use heuristicInternational Transactions in Operational Research201320218919910.1111/j.1475-3995.2012.00868.x
  • CuiYYangYA heuristic for the one-dimensional cutting stock problem with usable leftoverEuropean Journal of Operational Research2010204224525010.1016/j.ejor.2009.10.028
  • DempeSFoundations of Bilevel Programming2002
  • DyckhoffHA new linear programming approach to the cutting stock problemOperations Research19812961092110410.1287/opre.29.6.1092
  • EgebladJPisingerDHeuristic approaches for the two- and three-dimensional knapsack packing problemComputers & Operations Research20093641026104910.1016/j.cor.2007.12.004
  • GradisarMJesenkoJResinovicCOptimization of roll cutting in clothing industryComputers & Operations Research1997241094595310.1016/S0305-0548(97)00005-1
  • GradisarMErjavecJTomatLOne-dimensional cutting stock optimization with usable leftover: A case of low stock-to-order ratioInternational Journal of Decision Support System Technology201131546610.4018/jdsst.2011010104
  • HadjiconstantinouEChristofidesNAn exact algorithm for general, orthogonal, two-dimensional knapsack-problemsEuropean Journal of Operational Research1995831395610.1016/0377-2217(93)E0278-6
  • HarjunkoskiIPornRWesterlundTSkrifvarsHDifferent strategies for solving bilinear integer non-linear programming problems with convex transformationsComputers and Chemical Engineering199721Supplement SS487S49210.1016/S0098-1354(97)00096-3
  • KockSKonigSWascherGInteger linear programming for a cutting problem in the wood-processing industry: A case studyInternational Transactions in Operational Research200916671572610.1111/j.1475-3995.2009.00704.x
  • Oliveira JF (2012). ESICUP—EURO Special Interest Group on Cutting and Packing, http://www.fe.up.pt/esicup/, accessed 18 December 2012.
  • PadbergMPacking small boxes into a big boxMathematical Methods of Operations Research200052112110.1007/s001860000066
  • RoodmanGMNear-optimal solutions to one-dimensional cutting stock problemsComputers & Operations Research198613671371910.1016/0305-0548(86)90077-8
  • ScheithauerGA note on handling residual lengthsOptimization199122346146610.1080/02331939108843687
  • ScheithauerGTernoJModeling of packing problemsOptimization1993281638410.1080/02331939308843904
  • TsaiRDMalstromEEKuoWThree dimensional palletization of mixed box sizesIIE Transactions1993254647510.1080/07408179308964305
  • WäscherGHaußnerHSchumannHAn improved typology of cutting and packing problemsEuropean Journal of Operational Research200718331109113010.1016/j.ejor.2005.12.047
  • YanasseHHMorabitoRLinear models for 1-group two-dimensional guillotine cutting problemsInternational Journal of Production Research200644173471349110.1080/00207540500478603

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.