New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints

Authors:

Abstract
No abstract available

This publication has 11 references indexed in Scilit: