Loading optimization of an ordered set of aircrafts

This paper deals with the problem of optimal loading of the air vehicles set, ordered in accordance with the given priority rules. The regarded problem is formalized as a mixedinteger linear programming task. Proposed formalization requires twice less binary variables to formalize the conditions for the absence of the intersections of loaded objects in comparison with approaches, regarded in literature. The exact solution technology, designed in the form of a public web-service, is presented. Features and practical significance of the developed technology are described.