Hi, everyone!
I have th following problem:There are n cars on a rail track, numbered with distinct values from the set {1, 2, . . . , n}. A crane available at that location may pick k cars from the rail track and place them at the end of the sequence of cars (imagine this as being on the right hand side). Then, this cars are pushed to form a continuous line of cars.
Given the initial order of the cars, you are required to find (if possible) the minimum number of operations which the crane must execute to get the cars in sorted order,
i.e 1, 2, . . . , n.
Remark: this problem should be resolved using the Branch and Bound algorithm.

Any help would be appreciated. Thanks in advance.