Fetching the paper…
Reading the bibliography…
This paper seeks to tackle the bin packing problem (BPP) through a learning perspective.
A new linear programming approach to the cutting stock problem
Dyckhoff, H · 1981
Earlier work this paper cites.
Computers and intractability: A guide to the theory of np-completeness, 1983
Lewis, H. R · 1983
Earlier work this paper cites.
Knapsack problems: algorithms and computer implementations
Martello, S · 1990
Earlier work this paper cites.
Cutting and packing problems: a categorized, application-orientated research bibliography
Sweeney, P. E. and Paternoster, E. R · 1992
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J · 1992
Earlier work this paper cites.
Markov games as a framework for multi-agent reinforcement learning
Littman, M. L · 1994
Earlier work this paper cites.
Policy gradient methods for reinforcement learning with function approximation
Sutton, R. S., McAllester, D. A., Singh, S. P., Mansour, Y., et al · 1999
Earlier work this paper cites.
The three-dimensional bin packing problem
Martello, S., Pisinger, D., and Vigo, D · 2000
Earlier work this paper cites.
A parallel genetic algorithm for solving the container loading problem
Gehring, H. and Bortfeldt, A · 2002
Earlier work this paper cites.
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Lysgaard, J., Letchford, A. N., and Eglese, R. W · 2004
Earlier work this paper cites.
Cooperative multi-agent learning: The state of the art
Panait, L. and Luke, S · 2005
Earlier work this paper cites.
A comprehensive survey of multiagent reinforcement learning
Busoniu, L., Babuska, R., and De Schutter, B · 2008
Earlier work this paper cites.
Extreme point-based heuristics for three-dimensional bin packing
Crainic, T. G., Perboli, G., and Tadei, R · 2008
Earlier work this paper cites.
Linear programming: Theory and applications
Lewis, C · 2008
Earlier work this paper cites.
Solving the one-dimensional bin packing problem with a weight annealing heuristic
Loh, K.-H., Golden, B., and Wasil, E · 2008
Earlier work this paper cites.
A caving degree approach for the single container loading problem
Huang, W. and He, K · 2009
Earlier work this paper cites.
Propagating the bin packing constraint using linear programming
Cambazard, H. and O’Sullivan, B · 2010
Cited alongside, same era.
A tree search algorithm for solving the container loading problem
Fanslau, T. and Bortfeldt, A · 2010
Cited alongside, same era.
Three-dimensional bin packing problem with variable bin height
Wu, Y., Li, W., Goh, M., and de Souza, R · 2010
Cited alongside, same era.
A survey of monte carlo tree search methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., and Colton, S · 2012
Cited alongside, same era.
The six elements to block-building approaches for the single container loading problem
Zhu, W., Oon, W.-C., Lim, A., and Weng, Y · 2012
Cited alongside, same era.
Adam: A method for stochastic gradient descent
Kingma, D. P. and Ba, J. L · 2015
An improved nature inspired meta-heuristic algorithm for 1-d bin packing problems
Abdel-Basset, M., Manogaran, G., Abdel-Fatah, L., and Mirjalili, S · 2018
Later among the works it cites.
Counterfactual multi-agent policy gradients
Foerster, J., Farquhar, G., Afouras, T., Nardelli, N., and Whiteson, S · 2018
Later among the works it cites.
Gurobi optimizer reference manual, 2018
Gurobi Optimization, I · 2018
Later among the works it cites.
Attention, learn to solve routing problems!
Kool, W., van Hoof, H., and Welling, M · 2018
Later among the works it cites.
A multi-task selected learning approach for solving 3d flexible bin packing problem
Duan, L., Hu, H., Qian, Y., Gong, Y., Zhang, X., Wei, J., and Xu, Y · 2019
Later among the works it cites.
Ranked reward: Enabling self-play reinforcement learning for combinatorial optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al · 2015
Cited alongside, same era.
Pointer networks
Vinyals, O., Fortunato, M., and Jaitly, N · 2015
Cited alongside, same era.
Ba, J. L., Kiros, J. R., and Hinton, G. E · 2016
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., and Bengio, S · 2016
Cited alongside, same era.
Prioritized experience replay
Schaul, T., Quan, J., Antonoglou, I., and Silver, D · 2016
Cited alongside, same era.
Solving a new 3d bin packing problem with deep reinforcement learning method
Hu, H., Zhang, X., Yan, X., Wang, L., and Xu, Y · 2017
Cited alongside, same era.
Laterre, A., Fu, Y., Jabri, M. K., Cohen, A.-S., Kas, D., Hajjar, K., Dahl, T. S., Kerkeni, A., and Beguir, K · 2019
Later among the works it cites.
Language models are unsupervised multitask learners
Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., and Sutskever, I · 2019
Later among the works it cites.
Solving packing problems by conditional query learning, 2020
Li, D., Ren, C., Gu, Z., Wang, Y., and Lau, F · 2020
Later among the works it cites.
New symmetry-less ilp formulation for the classical one dimensional bin-packing problem
Salem, K. H. and Kieffer, Y · 2020
Later among the works it cites.
Simultaneous planning for item picking and placing by deep reinforcement learning
Tanaka, T., Kaneko, T., Sekine, M., Tangkaratt, V., and Sugiyama, M · 2020
Later among the works it cites.
Sequential markov games with ordered agents: A bellman-like approach
Yang, N. and Liu, J. J · 2020
Later among the works it cites.
Smart pack: Online autonomous object-packing system using rgb-d sensor data
Young-Dae, H., Young-Joo, K., and Ki-Baek, L · 2020
Later among the works it cites.
Solving 3d bin packing problem via multimodal deep reinforcement learning
Jiang, Y., Cao, Z., and Zhang, J · 2021
Closest in time.
Self-play learning strategies for resource assignment in open-ran networks
Wang, X., Thomas, J. D., Piechocki, R. J., Kapoor, S., Santos-Rodriguez, R., and Parekh, A · 2021
Closest in time.
Online 3d bin packing with constrained deep reinforcement learning
Zhao, H., She, Q., Zhu, C., Yang, Y., and Xu, K · 2021
Closest in time.