[HTML] sciencedirect.com

[HTML][HTML] A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - Elsevier
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …
被引用次数：65 相关文章
[PDF] academia.edu

[PDF][PDF] A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - academia.edu
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - dl.acm.org
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - ntut.elsevierpure.com
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …

A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - infona.pl
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …
[PDF] core.ac.uk

[PDF][PDF] A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - core.ac.uk
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …
[PDF] academia.edu

[PDF][PDF] A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints

HD Sherali, SC Sarin, PF Tsai - Discrete Optimization, 2006 - academia.edu
In this paper, we present a new class of polynomial length formulations for the asymmetric
traveling salesman problem (ATSP) by lifting an ordered path-based model using logical …