Funder
P.G. Demidov Yaroslavl State University
Yaroslavl Oblast
Publisher
Springer Science and Business Media LLC
Reference50 articles.
1. Aguilera NE, Katz RD, Tolomei PB (2017) Vertex adjacencies in the set covering polyhedron. Discret Appl Math 218:40–56. https://doi.org/10.1016/j.dam.2016.10.024
2. Alfakih AY, Murty KG (1998) Adjacency on the constrained assignment problem. Discret Appl Math 87(1):269–274. https://doi.org/10.1016/S0166-218X(98)00063-8
3. Alspach B (2008) The wonderful walecki construction. Bull Inst Combin Appl 52(52):7–20
4. Alspach B, Bermond JC, Sotteau D (1990) Decomposition into cycles i: hamilton decompositions. Springer, Netherlands, Dordrecht, pp 9–18. https://doi.org/10.1007/978-94-009-0517-7_2
5. Applegate DL, Bixby RE, Chvatál V, Cook WJ (2006) The traveling salesman problem: a computational study. Princeton University Press, New Jersey