4 papers
A Canceling Heuristic for the Directed Traveling Salesman Problem
Steffen Borgwardt, Zachary Sorenson
The Traveling Salesman Problem (TSP) is one of the classic and hard problems in combinatorial optimization. We develop a new heuristic that uses a connection between Minimum Cost F…
On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
Steffen Borgwardt, Nicholas Crawford, Sean Kafer +2
Circuits are fundamental objects in linear programming and oriented matroid theory, representing the elementary difference vectors of a polyhedron between points in its affine spac…
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
Steffen Borgwardt, ZdenÄk DvoÅák, Bryce Frederickson +2
The assignments of a set of items into clusters of prescribed sizes can be encoded as the vertices of the partition polytope . W…
Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
Steffen Borgwardt, Nicholas Crawford, Drew Horton +2
We study the problem of evacuation planning for natural disasters, focusing on wildfire evacuations. By creating pre-planned evacuation routes that can be updated based on real-tim…