Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.8, Iss.1, 2004-03, pp. : 65-84

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

Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems

By Hifi M. Roucairol C.

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 465-494

Springer Publishing Company

Access to resources Recommend Favorite

A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems

By G Y-G. Seong Y.-J. Kang M.-K.

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 301-307

Elsevier

Access to resources Recommend Favorite

One-Dimensional Cutting Stock Problem with a Given Number of Setups: A Hybrid Approach of Metaheuristics and Linear Programming

By Umetani Shunji Yagiura Mutsunoti Ibaraki Toshihide

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 1, 2006-04 ,pp. : 43-64

Springer Publishing Company

Access to resources Recommend Favorite

Some Problems in Two‐Dimensional Electrostriction

STUDIES IN APPLIED MATHEMATICS, Vol. 45, Iss. 1, 1966-04 ,pp. : 45-51

John Wiley & Sons Inc

Access to resources Recommend Favorite

Some Problems in Two‐Dimensional Electrostriction

STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1966-04 ,pp. : 45-51

John Wiley & Sons Inc

Access to resources Recommend Favorite