Mixed planar/network facility location problems
Computers and Operations Research
A linearization method for mixed 0-1 polynomial programs
Computers and Operations Research
| Hi-index | 0.01 |
Continuous location problems and network location problems are generally viewed as completely different classes of problems. We will show in this paper that despite the classical distinction between continuous and discrete optimization, there are many similarities that can be exploited both for the development of new location models and for the derivation of theoretical properties and solution methods. This interrelation gives rise to a new line of research combining ideas from the fields of continuous and network location.