Method for charging a plurality of motor vehicles (FZ1, FZ2), in particular hybrid electric/electric vehicles, at a plurality of public charging stations (LS1, LS2), having the following steps: - determining release times (tf1, tf2) at which the respective charging stations (LS1, LS2) are released for charging; - determining arrival times (ta11, ta12; ta21, ta22) at which the respective motor vehicles (FZ1, FZ2) may arrive at the respective charging stations (LS1, LS2); - calculating intervals of time between the respective determined release times (tf1, tf2) and the respective determined arrival times (ta11, ta12; ta21, ta22) as required waiting times (tw11, tw12; tw21, tw22) for charging the respective motor vehicles (FZ1, FZ2) at the respective charging stations (LS1, LS2); - determining energy requirements (Eb11, Eb12; Eb21, Eb22) of the respective motor vehicles (FZ1, FZ2) for approaching the respective charging stations (LS1, LS2); characterized by the further steps of: - comparing the determined energy requirements (Eb11, Eb12; Eb21, Eb22) with one another; - deciding, on the basis of the calculated waiting times (tw11, tw12; tw21, tw22) and on the basis of the result of the comparison between the determined energy requirements (Eb11, Eb12; Eb21, Eb22), which of the charging stations (LS1, LS2) will be approached by the respective motor vehicles (FZ1, FZ2) for charging, - with the proviso that a total waiting time, which forms a sum of waiting times (tw12, tw21) for charging the respective motor vehicles (FZ1, FZ2) at the respective charging stations (LS1, LS2), is minimized, and - with the proviso that a total energy requirement, which forms a sum of energy requirements which would be consumed by the motor vehicles in order to actually approach the corresponding charging stations, is minimized, - by weighting the determined energy requirements and the previously determined waiting times and subjecting them to a decision-making algorithm. - determining release times (tf1, tf2) at which the respective charging stations (LS1, LS2) are released for charging; - determining arrival times (ta11, ta12; ta21, ta22) at which the respective motor vehicles (FZ1, FZ2) may arrive at the respective charging stations (LS1, LS2); - calculating intervals of time between the respective determined release times (tf1, tf2) and the respective determined arrival times (ta11, ta12; ta21, ta22) as required waiting times (tw11, tw12; tw21, tw22) for charging the respective motor vehicles (FZ1, FZ2) at the respective charging stations (LS1, LS2); - determining energy requirements (Eb11, Eb12; Eb21, Eb22) of the respective motor vehicles (FZ1, FZ2) for approaching the respective charging stations (LS1, LS2); - comparing the determined energy requirements (Eb11, Eb12; Eb21, Eb22) with one another; - deciding, on the basis of the calculated waiting times (tw11, tw12; tw21, tw22) and on the basis of the result of the comparison between the determined energy requirements (Eb11, Eb12; Eb21, Eb22), which of the charging stations (LS1, LS2) will be approached by the respective motor vehicles (FZ1, FZ2) for charging, - with the proviso that a total waiting time, which forms a sum of waiting times (tw12, tw21) for charging the respective motor vehicles (FZ1, FZ2) at the respective charging stations (LS1, LS2), is minimized, and - with the proviso that a total energy requirement, which forms a sum of energy requirements which would be consumed by the motor vehicles in order to actually approach the corresponding charging stations, is minimized, - by weighting the determined energy requirements and the previously determined waiting times and subjecting them to a decision-making algorithm.