Multistars, partial multistars and the capacitated vehicle routing problem

 In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among the valid and facet-inducing inequalities presented in that paper were the so-called multistar and partial multistar inequalities, each of which came in several versions. Some related inequalities for the case of general demands have appeared subsequently and the result is a rather bewildering array of apparently different classes of inequalities. The main goal of the present paper is to present two relatively simple procedures that can be used to show the validity of all known (and some new) multistar and partial multistar inequalities, in both the unit and general demand cases. The procedures provide a unifying explanation of the inequalities and, perhaps more importantly, ideas that can be exploited in a cutting plane algorithm for the CVRP. Computational results show that the new inequalities can be useful as cutting planes for certain CVRP instances. Received: January 9, 1999 / Accepted: June 17, 2002 Published online: September 27, 2002 Key Words. vehicle routing – valid inequalities – cutting planes     

gl(∞) and geometric quantization

An axiomatic approach to the approximation of infinite dimensional algebras is presented; examples illustrating the need for a rigorous treatment of this subject. Geometric quantization is employed to construct systematicallysu(N) approximations of diffeomorphism algebras which first appeared in the theory of relativistic membranes.     

Motives and Etale Motives with Finite Coefficients

We prove that for suitable base fields, inverting the Bott element in Voevodsky’s category of motives with finite coefficients yields the category of étale motives with finite coefficients. Mathematics Subject Classifications (2000): 19E15, 14F42, 14F20. The first author was partially supported by the Clay Mathematics Institute.