Recent content by AntistatiK

Call it "the problem of traveling hauler", it's more intuitive. In the morning, he has a set of requests, such as "carry smth from A to B for $N". If he's on the road with no cargo, traffic cops fine him, also he burns out expensive fuel. He wants 2 earn the highest sum by the end of the day...

I'd like 2 solve the following problem (well, routinely solve a bunch of such problems): Let us have a number of points (vertices), that can be interconnected. Not any 2 points are connected. Each connection is assigned a value. I want 2 find the maximum path in the graph, that is, the one with...