| Publication | Date of Publication | Type |
|---|
Mixed-integer models for complete-linkage clustering
Annals of Operations Research | 2026-08-24 | Paper |
Hub location problems with asymmetric allocation
(available as arXiv preprint) | 2026-01-01 | Paper |
Uncovering latent consensus in heterogeneous populations: The Mixture Linear Ordering Problem
(available as arXiv preprint) | 2026-01-01 | Paper |
The capacitated vehicle routing problem with planned downtime
Computational Optimization and Applications | 2025-11-17 | Paper |
New models for close enough facility location problems
Computers & Operations Research | 2025-06-05 | Paper |
Some new clique inequalities in four-index hub location models
European Journal of Operational Research | 2025-05-16 | Paper |
Optimizing Weak Orders via Integer Linear Programming
(available as arXiv preprint) | 2025-01-01 | Paper |
Formulations and valid inequalities for the capacitated dispersion problem
Networks | 2023-12-18 | Paper |
Upgrading edges in the graphical TSP
Computers & Operations Research | 2023-09-13 | Paper |
An exact approach for the reliable fixed-charge location problem with capacity constraints
European Journal of Operational Research | 2023-07-11 | Paper |
Dendrograms, minimum spanning trees and feature selection
European Journal of Operational Research | 2023-07-10 | Paper |
Comparing two SVM models through different metrics based on the confusion matrix
Computers & Operations Research | 2023-07-04 | Paper |
The single-vehicle two-echelon one-commodity pickup and delivery problem
Computers & Operations Research | 2021-05-21 | Paper |
The linear ordering problem with clusters: a new partial ranking
Top | 2021-05-05 | Paper |
A linear ordering problem of sets
Annals of Operations Research | 2020-04-22 | Paper |
Multi-objective evolutionary algorithms for a reliability location problem
European Journal of Operational Research | 2020-01-23 | Paper |
Facility location problems with user cooperation
Top | 2019-06-17 | Paper |
Median and covering location problems with interconnected facilities
Computers & Operations Research | 2019-04-18 | Paper |
A polyhedral study on 0-1 knapsack problems with set packing constraints
Operations Research Letters | 2018-10-01 | Paper |
Introducing capacities in the location of unreliable facilities
European Journal of Operational Research | 2018-05-25 | Paper |
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
Computational Optimization and Applications | 2018-02-01 | Paper |
On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem
Journal of Global Optimization | 2017-04-28 | Paper |
Rank aggregation in cyclic sequences
Optimization Letters | 2017-04-20 | Paper |
| Robust DEA efficiency scores: A probabilistic/combinatorial approach | 2016-11-22 | Paper |
Looking for edge-equitable spanning trees
Computers & Operations Research | 2016-11-10 | Paper |
Strengthening the reliability fixed-charge location model using clique constraints
Computers & Operations Research | 2016-11-10 | Paper |
The multiple vehicle pickup and delivery problem with LIFO constraints
European Journal of Operational Research | 2016-10-06 | Paper |
Robust DEA efficiency scores: A probabilistic/combinatorial approach
(available as arXiv preprint) | 2016-01-01 | Paper |
Alternative formulations for the set packing problem and their application to the winner determination problem
Annals of Operations Research | 2013-09-16 | Paper |
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
European Journal of Operational Research | 2012-12-29 | Paper |
Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
European Journal of Operational Research | 2012-12-29 | Paper |
Stochastic set packing problem
European Journal of Operational Research | 2012-10-26 | Paper |
New facets for the two-stage uncapacitated facility location polytope
Computational Optimization and Applications | 2010-01-25 | Paper |
A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
Top | 2009-02-17 | Paper |
New formulations for the uncapacitated multiple allocation hub location problem
European Journal of Operational Research | 2006-03-24 | Paper |
Facet Obtaining Procedures for Set Packing Problems
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
On the facets of the simple plant location packing polytope
Discrete Applied Mathematics | 2002-12-02 | Paper |
Extreme points of discrete location polyhedra
Top | 2001-10-10 | Paper |
New facets for the set packing polytope
Operations Research Letters | 2000-01-01 | Paper |
