We survey some analytic methods of volume calculation and introduce a distance function for pairs of polytopes based on their volumes. We study the distance function in the context of three familiar settings of combinatorial optimization: (i) Chvátal–Gomory rounding, (ii) fixed-charged problems, and (iii) vertex packing.