Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.139, Iss.1, 2005-10, pp. : 243-265

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 1, Iss. 2, 2010-04 ,pp. : 34-49

IGI Global_journal

Access to resources Recommend Favorite

Shadow price based genetic algorithms for the cutting stock problem

By Shen Gang Zhang Yan-Qing

International Journal of Artificial Intelligence and Soft Computing, Vol. 3, Iss. 1, 2012-07 ,pp. : 50-69

Inderscience Publishers

Access to resources Recommend Favorite

Rapid prototyping frameworks for developing scientific applications: A case study

By Rickett Christopher Choi Sung-Eun Rasmussen Craig Sottile Matthew

The Journal of Supercomputing, Vol. 36, Iss. 2, 2006-05 ,pp. : 123-134

Springer Publishing Company

Access to resources Recommend Favorite

A case study of memetic algorithms for constraint optimization

By Özcan Ender

Soft Computing, Vol. 13, Iss. 8-9, 2009-07 ,pp. : 871-882

Springer Publishing Company

Access to resources Recommend Favorite

Online cutting stock optimization with prioritized orders

By Ghodsi R. Sassani F.

Assembly Automation, Vol. 25, Iss. 1, 2005-03 ,pp. : 66-72

Emerald Group Publishing Ltd

Access to resources Recommend Favorite