The two problems are as follows: One is 2WPP, which is got by restricting the postman to traverse each edge no more than twice in the case of the windy postman problem; the other is the maximum weighted cycle packing problem on windy graphs.

Research on Heuristic Algorithms for the Two-dimensional Packing Problem;

A quasi-human algorithm was proposed for solving the cuboid packing problem in real life,whose main idea was to formalize the Chinese life experience formed in the past five thousand years by the western modern mathematical tools to develop it.

Packing problem is NP complete,this paper uses an immune genetic algorithm to solve it.

Online algorithms for a relaxed variable-sized bin packing;

On-line A-shaped bin packing problem: models and analysis of heuristics;

As one of the constrained bin packing problem(BPP),coloring BPP has many important applications such as multi-processor real-time scheduling,etc.

A new coding method that uses the genetic algorithm to solve the bin-packing problem;

The inheritance algorithm of a kind of chromosomes with changeable length to solve the bin-packing problem;

Genetic algorithm based on group coding for bin-packing problem;

The study on large scale two dimensional Bin Packing Problem and its tabu search algorithm;

Research on three dimensional bin packing problem with multi-type bins based on tabu search algorithm

As the extension of classical bin packing problems (BPP),coloring BPP has many important applications in multi-processor real-time scheduling.

In order to solve bin-packing problem efficiently,multi-group genetic algorithm is proposed and the complete algorithm procedures are described.