A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

Version 2 2024-06-04, 14:23

Version 1 2021-08-29, 21:21

journal contribution

posted on 2024-06-04, 14:23 authored by Sergey PolyakovskiySergey Polyakovskiy, R M'Hallah

A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

History

Journal

European Journal of Operational Research

Volume

299

Pagination

104-117

Location

Amsterdam, The Netherlands

Publisher DOI

https://doi.org/10.1016/j.ejor.2021.08.037

ISSN

0377-2217

eISSN

1872-6860

Language

English

Author URL

http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000743574900008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=a045e4b2bb1f2b747c68c720ec8913b7

Notes

Article in Press

Publication classification

C1 Refereed article in a scholarly journal

Issue

1

Publisher

ELSEVIER

Usage metrics

Categories

No categories selected

Keywords

Social Sciences Science & Technology Technology Management Operations Research & Management Science Business & Economics Cutting Variable-sized bin packing Matheuristic Lookahead search Feasibility constraints ALGORITHM HEURISTICS FRAMEWORK 4602 Artificial intelligence

Licence

All Rights Reserved

Exports

RefWorks

BibTeX

Ref. manager

Endnote

DataCite

NLM

DC