Brute Force Spatial Optimization: When It’s Okay

Authors: F. Antonio Medrano*, Texas A&M University - Corpus Christi, TX
Topics: Spatial Analysis & Modeling
Keywords: spatial optimization, computational methods
Session Type: Paper
Day: 4/6/2019
Start / End Time: 8:00 AM / 9:40 AM
Room: Roosevelt 4, Marriott, Exhibition Level
Presentation File: No File Uploaded


Linear and integer programming forms the basis of modeling and solving many spatial optimization problems efficiently. Brute force enumeration techniques are typically avoided, as the combinatorial nature for such problems require iterations that grow factorially with respect to problem size. But in certain scenarios, exact solutions can be found more quickly using enumeration rather than an IP formulation, and in other cases enumerative solutions may provide fast bounds for an IP model. This talk discusses such scenarios, and high-performance computing techniques for implementing enumeration as applied to solving a p-center facility location problem.

Abstract Information

This abstract is already part of a session. View the session here.

To access contact information login