One-dimensional identification problem and ranking parameters

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.48, Iss.1, 2010-09, pp. : 29-40

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 Improvement Heuristic for the One-Dimensional Bin Packing Problem

By Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J.

Journal of Heuristics, Vol. 10, Iss. 2, 2004-03 ,pp. : 205-229

Springer Publishing Company

Access to resources Recommend Favorite

Exact and approximate methods for a one-dimensional minimax bin-packing problem

By Brusco Michael

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 611-626

Springer Publishing Company

Access to resources Recommend Favorite

A new heuristic algorithm for the one-dimensional bin-packing problem

By Gupta J. N. D. Ho J. C.

Production Planning and Control, Vol. 10, Iss. 6, 1999-09 ,pp. : 598-603

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the one-dimensional stock cutting problem in the paper tube industry

By Matsumoto Kazuki

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 281-290

Springer Publishing Company

Access to resources Recommend Favorite

Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 2, Iss. 1, 2011-01 ,pp. : 34-48

IGI Global_journal

Access to resources Recommend Favorite