Packing entering sets in kernel systems (2012)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- Assunto: OTIMIZAÇÃO COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher: Mathematical Optimization Society
- Publisher place: Philadelphia
- Date published: 2012
- Source:
- Título do periódico: Book of abstracts
- Conference titles: International Symposium on Mathematical Programming (ISMP 2012)
-
ABNT
LESTON-REY, Mario e WAKABAYASHI, Yoshiko. Packing entering sets in kernel systems. 2012, Anais.. Philadelphia: Mathematical Optimization Society, 2012. Disponível em: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf. Acesso em: 29 mar. 2024. -
APA
Leston-Rey, M., & Wakabayashi, Y. (2012). Packing entering sets in kernel systems. In Book of abstracts. Philadelphia: Mathematical Optimization Society. Recuperado de http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf -
NLM
Leston-Rey M, Wakabayashi Y. Packing entering sets in kernel systems [Internet]. Book of abstracts. 2012 ;[citado 2024 mar. 29 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf -
Vancouver
Leston-Rey M, Wakabayashi Y. Packing entering sets in kernel systems [Internet]. Book of abstracts. 2012 ;[citado 2024 mar. 29 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf - Um algoritmo híbrido para o problema de corte unidimensional
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Composition of facets of the clique partitioning polytope
- On the circuit cover problem for mixed graphs
- Near-optimum universal graphs for graphs with bounded degrees
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Tree 3-spanners on generalized prisms of graphs
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- Sobre grafos hamiltonianos
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas