Andrew Eremin

According to our database, Andrew Eremin authored at least 5 papers between 2001 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2006

Enforcing path uniqueness in internet routing.

Daniel Lucraft, Andrew Eremin, Farid Ajili

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths.

Farid Ajili, Robert Rodosek, Andrew Eremin

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

2004

Using dual values to integrate row and column generation into constant logic.

Andrew Eremin

PhD thesis, 2004

Problem Decomposition for Traffic Diversions.

Quanshi Xia, Andrew Eremin, Mark Wallace

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

2001

Hybrid Benders Decomposition Algorithms in Constraint Logic Programming.

Andrew Eremin, Mark Wallace

Proceedings of the Principles and Practice of Constraint Programming, 2001