Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

Solving non-oriented two dimensional bin

Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation

✍ Omar, Mohamed K.; Ramakrishnan, Kumaran 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 348 KB

A mixed integer programming formulation

A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application

✍ Paquay, C.; Schyns, M.; Limbourg, S. 📂 Article 📅 2014 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Volume 3011 || Combining Forces to Solve the Car Sequencing Problem

✍ Régin, Jean-Charles; Rueher, Michel 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 174 KB

This Book Constitutes The Refereed Proceedings Of The First International Conference On Integration Of Ai And Or Techniques In Constraint Programming For Combinatorial Optimization Problems, Cpaior 2004, Held In Nice, France In April 2004. The 23 Revised Full Papers And 7 Revised Short Papers Presen

[Lecture Notes in Computer Science] Inte

[Lecture Notes in Computer Science] Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Volume 5547 || A Fast Algorithm to Solve the Frequency Assignment Problem

✍ Hoeve, Willem-Jan; Hooker, John N. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 138 KB

This book constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009. The 20 revised full papers and 10 extended abstracts pre

[ACM Press the 13th annual conference co

[ACM Press the 13th annual conference companion - Dublin, Ireland (2011.07.12-2011.07.16)] Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11 - A hyper-heuristic for solving one and two-dimensional bin packing problems

✍ López-Camacho, Eunice; Terashima-Marín, Hugo; Ross, Peter 📂 Article 📅 2011 🏛 ACM Press ⚖ 437 KB

[ACM Press the 13th annual conference co

[ACM Press the 13th annual conference companion - Dublin, Ireland (2011.07.12-2011.07.16)] Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11 - A hyper-heuristic for solving one and two-dimensional bin packing problems

✍ López-Camacho, Eunice; Terashima-Marín, Hugo; Ross, Peter 📂 Article 📅 2011 🏛 ACM Press ⚖ 437 KB

The idea behind hyper-heuristics is to discover rules that relate different problem states with the best single heuristic to apply. This investigation works towards extending the problem domain in which a given hyper-heuristic can be applied and implements a framework to generate hyperheuristics for