On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets (1981)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/0012-365X(81)90021-2
- Subjects: PROGRAMAÇÃO LINEAR; TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Discrete Mathematics
- ISSN: 0012-365X
- Volume/Número/Paginação/Ano: v. 34, n. 1, p. 43-59, 1981
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
- Licença: publisher-specific-oa
-
ABNT
GROTSCHEL, Martin e WAKABAYASHI, Yoshiko. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics, v. 34, n. 1, p. 43-59, 1981Tradução . . Disponível em: https://doi.org/10.1016/0012-365X(81)90021-2. Acesso em: 10 jan. 2026. -
APA
Grotschel, M., & Wakabayashi, Y. (1981). On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. Discrete Mathematics, 34( 1), 43-59. doi:10.1016/0012-365X(81)90021-2 -
NLM
Grotschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. Discrete Mathematics. 1981 ; 34( 1): 43-59.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1016/0012-365X(81)90021-2 -
Vancouver
Grotschel M, Wakabayashi Y. On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets [Internet]. Discrete Mathematics. 1981 ; 34( 1): 43-59.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1016/0012-365X(81)90021-2 - Convex recoloring of paths
- On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Hardness and inapproximability of convex recoloring problems
- Polynomial-time approximation schemes for circle packing problems
- Sobre grafos hamiltonianos
- Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
- Polyhedral and computational results on the k-hop connected dominating set problem
- Facets of the clique partitioning polytope
- Approximation results on balanced connected partitions of graphs
- The maximum agreement forest problem: approximation algorithms and computational experiments
Informações sobre o DOI: 10.1016/0012-365X(81)90021-2 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
