scientific article; zbMATH DE number 2014735

zbMATH Open1031.68586MaRDI QIDQ4438009FDOQ4438009

Authors: Alexandre de Oliveira, Luiz Antonio Nogueira Lorena 

Publication date: 8 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2507/25070313.htm

Title of this publication is not available (Why is that?)

Recommendations

• A biased random-key genetic algorithm for the minimization of open stacks problem
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Analysis of distributed genetic algorithms for solving cutting problems
• On a pattern sequencing problem to minimize the maximum number of open stacks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (2)

• A biased random-key genetic algorithm for the minimization of open stacks problem
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4438009)