A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems-Reference-Cited by-同舟云学术

A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems

Published:2018 Issue: Volume: Page:462-476
ISSN:0302-9743
Container-title:Integration of Constraint Programming, Artificial Intelligence, and Operations Research
language:
Short-container-title:

Author:

Olivier Philippe,Lodi Andrea,Pesant Gilles

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-93031-2_33

Reference14 articles.

1. Lewis, R.: Constructing wedding seating plans: a tabu subject. In: CSREA Press, pp. 24–32 (2013)

2. Miettinen, K.: Nonlinear Multiobjective Optimization. Springer, Heidelberg (1998). https://doi.org/10.1007/978-1-4615-5563-6

3. Lewis, R., Carroll, F.: Creating seating plans: a practical application. J. Oper. Res. Soc. 67(11), 1353–1362 (2016)

4. Bellows, M.L., Peterson, J.D.L.: Finding an optimal seating chart for a wedding. https://www.improbable.com/2012/02/12/finding-an-optimal-seating-chart-for-a-wedding . Accessed 23 May 2018

5. Schaus, P.: Solving balancing and bin-packing problems with constraint programming. Ph.D thesis, Université catholique de Louvain (2009)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation;INFORMS Journal on Computing;2021-12-17

2. The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints;INFORMS Journal on Computing;2021-07

3. Fault tolerant resource allocation in fog environment using game theory‐based reinforcement learning;Concurrency and Computation: Practice and Experience;2021-03-18