A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

Souza Queiroz, Layane Rodrigues de; Andretta, Marina

doi:10.1111/itor.13122

Record: found
Abstract: not found
Article: not found

A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

Author(s): Layane Rodrigues de Souza Queiroz ¹ , Marina Andretta ¹

Publication date (Electronic): February 07 2022

Journal: International Transactions in Operational Research

Publisher: Wiley

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 41

Record: found
Abstract: not found
Article: not found

Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

A. Soyster (1973)

0 comments Cited 196 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

An improved typology of cutting and packing problems

Holger Schumann, Gerhard Wäscher, Heike Haußner (2007)

0 comments Cited 75 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Variable neighbourhood search: methods and applications

Nenad Mladenovìc, Josè Moreno-Pèrez, Pierre Hansen (2010)

0 comments Cited 54 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Contributors

Layane Rodrigues de Souza Queiroz: (View ORCID Profile)

Marina Andretta: (View ORCID Profile)

Journal

Title: International Transactions in Operational Research

Abbreviated Title: Int Trans Operational Res

Publisher: Wiley

ISSN (Print): 0969-6016

ISSN (Electronic): 1475-3995

Publication date Created: November 2022

Publication date (Electronic): February 07 2022

Publication date (Print): November 2022

Volume: 29

Issue: 6

Pages: 3486-3513

Affiliations

[1 ]Instituto de Ciências Matemáticas e de Computação Universidade de São Paulo São Carlos‐SP 13566‐590 Brazil

Article

DOI: 10.1111/itor.13122

SO-VID: 12230257-2355-4ac6-8adf-cfa535b16dec

License:

http://onlinelibrary.wiley.com/termsAndConditions#vor

http://doi.wiley.com/10.1002/tdm_license_1.1

History

Data availability:

A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands

Read this article at

Related collections

Tajseer Journal

Most cited references 41

Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

An improved typology of cutting and packing problems

Variable neighbourhood search: methods and applications

Author and article information

Contributors

Journal

Affiliations

Article

History

Comments

Comment on this article

Similar content 1,510

Cited by 2

Most referenced authors 274