| Heuristics for the dynamic facility location problem with modular capacities | 0 | 0.34 | 2021 |
| A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering | 0 | 0.34 | 2021 |
| On Improving Deep Learning Trace Analysis with System Call Arguments | 0 | 0.34 | 2021 |
| A Framework For Detecting System Performance Anomalies Using Tracing Data Analysis | 1 | 0.36 | 2021 |
| Preface To The Special Issue Of Jogo On The Occasion Of The 40th Anniversary Of The Group For Research In Decision Analysis (Gerad) | 0 | 0.34 | 2021 |
| The Covering-Assignment Problem for Swarm-powered Ad-hoc Clouds: A Distributed 3D Mapping Use-case | 2 | 0.37 | 2021 |
| Scaling Optimizations for Large-Scale Distributed Data with Lightweight Coresets | 0 | 0.34 | 2020 |
| Convex fuzzy k-medoids clustering | 0 | 0.34 | 2020 |
| A Soft Alignment Model for Bug Deduplication | 0 | 0.34 | 2020 |
| An Exact CP Approach for the Cardinality-Constrained Euclidean Minimum Sum-of-Squares Clustering Problem. | 0 | 0.34 | 2020 |
| RecSeats: A Hybrid Convolutional Neural Network Choice Model for Seat Recommendations at Reserved Seating Venues | 1 | 0.35 | 2020 |
| Automatic Cause Detection of Performance Problems in Web Applications. | 0 | 0.34 | 2019 |
| Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. | 2 | 0.36 | 2019 |
| Empirical Comparison between Autoencoders and Traditional Dimensionality Reduction Methods | 0 | 0.34 | 2019 |
| A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. | 2 | 0.38 | 2018 |
| On the k-Medoids Model for Semi-supervised Clustering. | 0 | 0.34 | 2018 |
| Efficient heuristics for the minimum labeling global cut problem. | 0 | 0.34 | 2018 |
| Parallel synchronous and asynchronous coupled simulated annealing. | 0 | 0.34 | 2018 |
| A Review Of Dynamic Data Envelopment Analysis: State Of The Art And Applications | 7 | 0.52 | 2018 |
| Towards Station-Level Demand Prediction for Effective Rebalancing in Bike-Sharing Systems. | 4 | 0.40 | 2018 |
| The Weighted Fair Sequences Problem. | 0 | 0.34 | 2018 |
| A Scalable Shared-Memory Parallel Simplex for Large-Scale Linear Programming. | 0 | 0.34 | 2018 |
| NP-Hardness of balanced minimum sum-of-squares clustering. | 2 | 0.40 | 2017 |
| On Strategies to Fix Degenerate k-means Solutions. | 0 | 0.34 | 2017 |
| Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. | 4 | 0.44 | 2017 |
| A model for clustering data from heterogeneous dissimilarities. | 6 | 0.41 | 2016 |
| A Derivative-Free Algorithm For Refining Numerical Microaggregation Solutions | 1 | 0.36 | 2015 |
| Reactive Search strategies using Reinforcement Learning, local search algorithms and Variable Neighborhood Search. | 7 | 0.41 | 2014 |
| On the Weber facility location problem with limited distances and side constraints. | 3 | 0.45 | 2014 |
| Column generation bounds for numerical microaggregation | 3 | 0.40 | 2014 |
| Global optimization workshop 2012 | 0 | 0.34 | 2014 |
| An improved column generation algorithm for minimum sum-of-squares clustering | 28 | 1.01 | 2012 |
| A VNS heuristic for escaping local extrema entrapment in normalized cut clustering | 7 | 0.46 | 2012 |
| .Modularity Maximization In Networks By Variable Neighborhood Search | 6 | 0.61 | 2012 |
| Adaptive memory in multistart heuristics for multicommodity network design | 4 | 0.40 | 2011 |
| Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering | 3 | 0.39 | 2011 |
| NP-hardness of Euclidean sum-of-squares clustering | 219 | 7.70 | 2009 |
| A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints | 7 | 0.58 | 2008 |
| An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem | 10 | 0.86 | 2008 |
| Scheduling workover rigs for onshore oil production | 15 | 0.84 | 2006 |
