On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets (1981)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/BFb0120923
- Subjects: PROGRAMAÇÃO LINEAR; TEORIA DOS GRAFOS
- Keywords: asymmetric travelling salesman problem; facets; cutting planes; hypotraceable digraphs; hypohamiltonian digraphs
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: Mathematische Optimierung
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
GRÖTSCHEL , Martin e WAKABAYASHI, Yoshiko. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets. 1981, Anais.. Berlin: Springer, 1981. Disponível em: https://doi.org/10.1007/BFb0120923. Acesso em: 22 jan. 2026. -
APA
Grötschel , M., & Wakabayashi, Y. (1981). On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets. In Mathematical programming at Oberwolfach. Berlin: Springer. doi:10.1007/BFb0120923 -
NLM
Grötschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets [Internet]. Mathematical programming at Oberwolfach. 1981 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/BFb0120923 -
Vancouver
Grötschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets [Internet]. Mathematical programming at Oberwolfach. 1981 ;[citado 2026 jan. 22 ] Available from: https://doi.org/10.1007/BFb0120923 - Polyhedral and computational results on the k-hop connected dominating set problem
- A note on the approximability of cutting stock problems
- On dominating sets of maximal outerplanar graphs
- The complexity of computing medians of relations
- Polynomial-time approximation schemes for circle packing problems
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Hypotraceable digraphs
Informações sobre o DOI: 10.1007/BFb0120923 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
