Is considered the orthogonal packing problem that is a problem of placing of all given orthogonal objects into a minimal set of orthogonal containers in a form of parallelepipeds of arbitrary dimension. With the aim of effective managing of free spaces in containers is proposed a deleting objects algorithm. This algorithm provides a possibility of realization of heuristic methods which are based on excluding of some placed objects from a container and subsequent more rational filling of the freed spaces into it.