New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP

ISSN： 1432-2994

Source： Mathematical Methods of Operations Research, Vol.66, Iss.1, 2007-08, pp. : 69-98

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Heuristic and Exact Algorithms for the Precedence-Constrained Knapsack Problem

By Samphaiboon N. Yamada Y.

Journal of Optimization Theory and Applications, Vol. 105, Iss. 3, 2000-06 ,pp. : 659-676

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

By Chudak F.A. Shmoys D.B.

Journal of Algorithms, Vol. 30, Iss. 2, 1999-02 ,pp. : 323-343

Academic Press

Access to resources Recommend Favorite

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

By Misener Ruth Smadbeck James B. Floudas Christodoulos A.

Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. : 215-249

Taylor & Francis Ltd

Access to resources Recommend Favorite

Transformations of generalized ATSP into ATSP

By Ben-Arieh D. Gutin G. Penn M. Yeo A. Zverovitch A.

Operations Research Letters, Vol. 31, Iss. 5, 2003-09 ,pp. : 357-365

Elsevier

Access to resources Recommend Favorite

Cutting planes from a mixed integer Farkas lemma

By Koppe M. Weismantel R.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 207-211

Elsevier

Access to resources Recommend Favorite