The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...