On one twocriterial graph problem

It is supposed that each edge of a graph has two number characteristics: the length and the width. The sum of the lengths of the edges of a subgraph is called the length of the subgraph, the maximal width of the edges of subgraph is called the width of subgraph. The length of subgraph is a negative characteristic of subgraph, the width of subgraph is its positive characteristic. The certain kinds of subgraphs are called admissible. A two-criterial problem of searching a Pareto optimal admissible subgraph is considered. Bibl. 5.