Topic: The task of the direct-sales representative with storage.
Colleagues, there was such strange question. Whether it is possible to reduce to the task of the direct-sales representative the task at which costs function depends on a way, for example a scoring maximum if between a point of a route And and a point of route B it has been transited exactly N nodes? If it is possible, as? Basically, as far as I understand, is (whether there is) the turbid decision to do N copies of the initial graph and at visiting of everyone points to pass from a copy to a copy (as it in . becomes), but can eat a method easier?