Facets of the clique partitioning polytope (1990)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/BF01580870
- Assunto: COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 1990
- Source:
- Título: Mathematical Programming
- ISSN: 0025-5610
- Volume/Número/Paginação/Ano: v. 47, n. 3 , p. 367-387, 1990
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GROTSCHEL, M e WAKABAYASHI, Yoshiko. Facets of the clique partitioning polytope. Mathematical Programming, v. 47, n. 3 , p. 367-387, 1990Tradução . . Disponível em: https://doi.org/10.1007/BF01580870. Acesso em: 10 jan. 2026. -
APA
Grotschel, M., & Wakabayashi, Y. (1990). Facets of the clique partitioning polytope. Mathematical Programming, 47( 3 ), 367-387. doi:10.1007/BF01580870 -
NLM
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1007/BF01580870 -
Vancouver
Grotschel M, Wakabayashi Y. Facets of the clique partitioning polytope [Internet]. Mathematical Programming. 1990 ; 47( 3 ): 367-387.[citado 2026 jan. 10 ] Available from: https://doi.org/10.1007/BF01580870 - 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
- Approximation results on balanced connected partitions of graphs
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
Informações sobre o DOI: 10.1007/BF01580870 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
