Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
The tradeoff between the speed and quality of the solutions obtained by various construction and local search algorithms for the elementary bin packing problem (BPP) are analyzed to obtain useful information for designing algorithms for real-world problems that can be modeled as BPPs. On the basis of intensive computational experiments, we observe that the framework of a solution (i.e., a part of a solution consisting of large items or items with tight constraints) should be constructed in the early stages of a local search. New local search algorithms are proposed as empirical support for the observation.
Imran Nasim, Melanie Weber
SCML 2024
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
Ben Fei, Jinbai Liu
IEEE Transactions on Neural Networks
Victor Akinwande, Megan Macgregor, et al.
IJCAI 2024