Optimal set partitioningHWANG, F. K; SUN, J; YAO, E. Y et al.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 1, pp 163-170, issn 0196-5212Article

UN PROBLEME DE PARTITION OPTIMALE DE LA MEMOIRE DES APPELS EN ZONESCHURKINA LV.1973; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1973; NO 2; PP. 116-119; BIBL. 5 REF.Serial Issue

A near-optimal initial seed value selection in K-means algorithm using a genetic algorithmPHANENDRA BABU, G; NARASIMHA MURTY, M.Pattern recognition letters. 1993, Vol 14, Num 10, pp 763-769, issn 0167-8655Article

Optimal nodes for interpolatory product integrationSMITH, W. E; PAGET, D.SIAM journal on numerical analysis. 1992, Vol 29, Num 2, pp 586-600, issn 0036-1429Article

OPTIMAL PARTITIONSHWANG FK.1981; J. OPTIM. THEORY APPL.; ISSN 0022-3239; USA; DA. 1981; VOL. 34; NO 1; PP. 1-10; BIBL. 8 REF.Article

OPAL: A NEW ALGORITHM FOR OPTIMAL PARTITIONING AND LEARNING IN NONPARAMETRIC UNSUPERVISED ENVIRONMENTSSHEELA BV; DASARATHY BV.1979; INTERNATION. J. COMPUTER INFORM. SCI.; USA; DA. 1979; VOL. 8; NO 3; PP. 239-253; BIBL. 20 REF.Article

Minimal connected enclosures on an embedded planar graphALEXOPOULOS, C; PROVAN, J. S; RATLIFF, H. D et al.Discrete applied mathematics. 1999, Vol 91, Num 1-3, pp 25-38, issn 0166-218XArticle

Optimal partition choice for invariant measure approximation for one-dimensional mapsMURRAY, Rua.Nonlinearity (Bristol. Print). 2004, Vol 17, Num 5, pp 1623-1644, issn 0951-7715, 22 p.Article

Regularity properties of optimal segmentationsMASSARI, U; TAMANINI, I.Journal für die reine und angewandte Mathematik. 1991, Vol 420, pp 61-84, issn 0075-4102Article

Navy personnel planning and the optimal partitionHOLDER, Allen.Operations research. 2005, Vol 53, Num 1, pp 77-89, issn 0030-364X, 13 p.Article

Optimal partitions for triplesETZION, T.Journal of combinatorial theory. Series A. 1992, Vol 59, Num 2, pp 161-176, issn 0097-3165Article

Partitioning planar graphsTHANG NGUYEN BUI; PECK, A.SIAM journal on computing (Print). 1992, Vol 21, Num 2, pp 203-215, issn 0097-5397Article

An optimum partition for inverting a nonsingular matrixJENN-CHING LUO.Applied mathematics letters. 1993, Vol 6, Num 5, pp 79-84, issn 0893-9659Article

Sensitivity analysis in linear optimization : Invariant support set intervals : Advances in continuous optimizationALIREZA GHAFFARI HADIGHEH; TERLAKY, Tamas.European journal of operational research. 2006, Vol 169, Num 3, pp 1158-1175, issn 0377-2217, 18 p.Conference Paper

An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problemANILY, Shoshana; BRAMEL, Julien.Discrete applied mathematics. 2004, Vol 145, Num 1, pp 22-39, issn 0166-218X, 18 p.Conference Paper

On parametric semidefinite programmingGOLDFARB, D; SCHEINBERG, K.Applied numerical mathematics. 1999, Vol 29, Num 3, pp 361-377, issn 0168-9274Conference Paper

Unifying optimal partition approach to sensitivity analysis in conic optimizationYILDIRIM, E. A.Journal of optimization theory and applications. 2004, Vol 122, Num 2, pp 405-423, issn 0022-3239, 19 p.Article

Clustering bipartite and chordal graphs : Complexity, sequential and parallel algorithmsABBAS, N; STEWART, L.Discrete applied mathematics. 1999, Vol 91, Num 1-3, pp 1-23, issn 0166-218XArticle

A new aggregation-disaggregation algorithmSHIOYAMA, T; TANAKA, K.European journal of operational research. 1995, Vol 83, Num 3, pp 655-669, issn 0377-2217Article

Permutation test in the optimal partition methodSEN'KO, O. V.Computational mathematics and mathematical physics. 2003, Vol 43, Num 9, pp 1368-1376, issn 0965-5425, 9 p.Article

AN EFFICIENT HEURISTIC CLUSTER ALGORITHM FOR TEARING LARGE-SCALE NETWORKS.SANGIOVANNI VINCENTELLI A; LI KUAN CHEN; CHUA LO et al.1977; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1977; VOL. 24; NO 12; PP. 709-717; BIBL. 24 REF.Article