Nodes that solve various location optimization problems.
This category contains 8 nodes.
Solve LSCP problem to minimize the number of facilities.
Solve LSCP problem to minimize the number of facilities within an impedance cutoff.
Maximal Accessibility Equality Problem (MAEP).
Solve MCLP problem to Maximize Capacitated Coverage by setting an impedance cutoff.
Solve MCLP problem to Maximize Capacitated Coverage by setting an impedance cutoff.
P-center (minimax) minimizes the maximum distance between demand points and their nearest facilities by locating p facilities.
Solve P-median problem minimize total weighted spatial costs.
Solve the P-median problem to minimize total weighted spatial costs.