benchmarks.wiki / Public workspace

Omni-MATH / This question is a followup of part b. In this question, we no longer fix the…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

This question is a followup of part b. In this question, we no longer fix the route in part b but find one to maximize the carrier's profit. Suppose that the carrier receives a fixed reward of r for each delivery and spends \ell, which equals the total lengths of the edges that s/he travels from pickup to delivery. In total, s/he makes a profit of r - \ell on this delivery. (We have set the cost factor of travel distance to 1, for simplicity.) Suppose that the carrier just picked up the original order and has this order only. What is his/her optimal route assuming the scooter's trunk has a capacity of 2 orders? You shall consider both the travel distance as a cost and the possible additional profit of r for picking up a new order. Because any new order has the same destination, its travel cost is ignored. Also, suppose that 0 \leq P_{e} \leq \min \{\ell_{e} / r, 1\}, where \ell_{e} is the length of edge e and P_{e} is defined in part b.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import