<  Retour au portail Polytechnique Montréal

Documents dont l'auteur est "Mladenović, Nenad"

Monter d'un niveau
Pour citer ou exporter [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Réseau de collaboration
Nuage de mots
Grouper par: Auteurs ou autrices | Date de publication | Sous-type de document | Aucun groupement
Aller à : A | C | D | G | H | M | P | R
Nombre de documents: 14

A

Aloise, D., Damasceno, N. C., Mladenović, N., & Pinheiro, D. N. (2017). On strategies to fix degenerate k-means solutions. Journal of Classification, 34(2), 165-190. Lien externe

Aloise, D., Damasceno, N. C., Mladenović, N., & Nobre Pinheiro, D. (2016). On strategies to fix degenerate k-means solutions. (Rapport technique n° G-2016-81). Lien externe

C

Costa, L. R., Aloise, D., & Mladenović, N. (2016). Less is more approach for balanced minimum sum-of-squares clustering. (Rapport technique n° G-2016-80). Lien externe

D

Džamić, D., Aloise, D., & Mladenović, N. (2019). Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization. Annals of Operations Research, 272(1-2), 273-287. Lien externe

Džamić, D., Aloise, D., & Mladenović, N. (2016). Ascent — Descent Variable Neighborhood Decomposition search for community detection by modularity maximization. (Rapport technique n° G-2016-35). Lien externe

G

Gonçalves-e-Silva, K., Aloise, D., Xavier-de-Souza, S., & Mladenović, N. (2018). Less is more: simplified Nelder-Mead method for large unconstrained optimization. Yugoslav Journal of Operations Research, 28(2), 153-169. Disponible

H

Hansen, P., Ngai, E., Cheung, B., & Mladenović, N. (2005). Analysis of Global K-Means, an Incremental Heuristic for Minimum Sum-of-Squares Clustering. Journal of Classification, 22(2), 287-310. Lien externe

M

Merle, O. D., Hansen, P., Jaumard, B., & Mladenović, N. (2000). An interior point algorithm for minimum sum-of-squares clustering. SIAM Journal on Scientific Computing, 21(4), 1485-1505. Lien externe

P

Pereira, T., Aloise, D., Brimberg, J., & Mladenović, N. (2018). Review of Basic Local Searches for Solving the Minimum Sum-of-Squares Clustering Problem. Dans Pardalos, P. M., & Migdalas, A. (édit.), Open Problems in Optimization and Data Analysis (Vol. 141, p. 249-270). Lien externe

Pyatkin, A., Aloise, D., & Mladenović, N. (2017). NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognition Letters, 97, 44-45. Lien externe

Pyatkin, A., Aloise, D., & Mladenović, N. (2016). NP-hardness of balanced minimum sum-of-squares clustering. (Rapport technique n° G-2016-79). Lien externe

Perron, S., Hansen, P., Le Digabel, S., & Mladenović, N. (2010). Exact and heuristic solutions of the global supply chain problem with transfer pricing. European Journal of Operational Research, 202(3), 864-879. Lien externe

R

Randel, R., Aloise, D., Mladenović, N., & Hansen, P. (octobre 2018). On the k-Medoids Model for Semi-supervised Clustering [Communication écrite]. 6th International Conference on Variable Neighborhood Search (ICVNS 2018), Sithonia, Greece. Lien externe

Randel, R., Aloise, D., Mladenović, N., & Hansen, P. (2018). On the k-medoids model for semi-supervised clustering. (Rapport technique n° G-2018-23). Lien externe

Liste produite: Fri Apr 25 03:07:53 2025 EDT.