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: 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: 21 jan. 2026. -
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 2026 jan. 21 ] 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 2026 jan. 21 ] Available from: http://ismp2012.zib.de/images/stories/bookofabstracts_onlineversion.pdf - Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Selfish 2D bin packing game
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Grafos e otimização combinatória
- Hypotraceable digraphs
- Some approximation results for the maximum agreement forest problem
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Minimum t-spanners on subcubic graphs
- The 2-Decomposition Conjecture for a new class of graphs
- An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
