Now showing items 1-2 of 2
Continuous location problems and Big Triangle Small Triangle: constructing better bounds [Article]
The Big Triangle Small Triangle method has shown to be a powerful global optimization procedure to address continuous location problems. In the paper published in J. Global Optim. (37:305–319, 2007), Drezner proposes a ...
Solving nonconvex planar location problems by nite dominating sets [Article]
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one ...