Similar Search Results

An algorithm for clustering with confidence-based must-link and cannot-link constraints

Baumann, Philipp; Hochbaum, Dorit S. - In: INFORMS journal on computing : JOC ; charting new … 37 (2025) 4, pp. 1044-1068

Persistent link: https://www.econbiz.de/10015453428

Exploring dual information in distance metric learning for clustering

Randel, Rodrigo; Aloise, Daniel; Hertz, Alain - 2021

Persistent link: https://www.econbiz.de/10012588027

A multi-objective bi-level location planning problem for stone industrial parks

Gang, Jun; Tu, Yan; Lev, Benjamin; Xu, Jiuping; Shen, … - In: Computers & operations research : and their … 56 (2015), pp. 8-21

Persistent link: https://www.econbiz.de/10010495464

Local search based heuristics for global optimization : atomic clusters and beyond

Locatelli, Marco; Schoen, Fabio - In: European journal of operational research : EJOR 222 (2012) 1, pp. 1-9

Persistent link: https://www.econbiz.de/10009569605

A dual reformulation and solution framework for regularized convex clustering problems

Pi, J.; Wang, Honggang; Pardalos, Panos M. - In: European journal of operational research : EJOR 290 (2021) 3, pp. 844-856

Persistent link: https://www.econbiz.de/10012495227

A matheuristic for large-scale capacitated clustering

Gnägi, Mario; Baumann, Philipp - In: Computers & operations research : and their … 132 (2021), pp. 1-15

Persistent link: https://www.econbiz.de/10012595678

A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization

Dehghanpour-Sahron, Ja'far; Mahdavi-Amiri, Nezam - In: 4OR : quarterly journal of the Belgian, French and … 19 (2021) 4, pp. 473-499

Persistent link: https://www.econbiz.de/10012697391

SOS-SDP : an exact solver for minimum sum-of-squares clustering

Piccialli, Veronica; Sudoso, Antonio M.; Wiegele, Angelika - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 4, pp. 2144-2162

Persistent link: https://www.econbiz.de/10013362706

Numerical Dynamic Programming on Parallel Computing Clusters : A 'MacGyver' Approach

Zainhofer, Florian - 2008

Economists who want to numerically approximate an elaborate dynamic stochastic programming problem (DSPP), either for structural estimation or policy evaluation purposes, are often confined by the curse of dimensionality: richer models with various state and control variables cannot be solved on...

Persistent link: https://www.econbiz.de/10014048078

Modified modularity density maximization and density ratio heuristic

Saleh, Zead; Pirim, Harun - In: Computers & operations research : and their … 150 (2023), pp. 1-12

Persistent link: https://www.econbiz.de/10013483688