A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Local Search Algorithms for the Maximum Carpool Matching Problem

unpublished

The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V, A), a capacity function c : V → N, and a weight function w : A → R + , a carpool matching is a subset of arcs, M ⊆ A, such that every v ∈ V satisfies: (i) d in M (v) · d out M (v) = 0, (ii) d in M (v) ≤ c(v), and (iii) d out M (v) ≤ 1. A vertex v for which d out M (v) = 1 is a passenger, and a vertex for which d out M (v) = 0 is a driver who has d in M (v) passengers. In

fatcat:dd2kfqj6cvdcreo7col3lk7x3q