| Publication | Date of Publication | Type |
|---|
The daily swab test collection problem
Annals of Operations Research | 2024-05-30 | Paper |
Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach
| 2023-08-03 | Paper |
The connected critical node problem
Theoretical Computer Science | 2022-06-13 | Paper |
Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
Computers & Operations Research | 2022-03-09 | Paper |
Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
Discrete Applied Mathematics | 2018-12-18 | Paper |
A preliminary analysis of the distance based critical node problem
| 2017-02-14 | Paper |
Searching for a cycle with maximum coverage in undirected graphs
Optimization Letters | 2016-10-27 | Paper |
A genetic algorithm for a class of critical node problems
| 2016-10-18 | Paper |
A single machine scheduling problem with two-dimensional vector packing constraints
European Journal of Operational Research | 2016-10-06 | Paper |
VNS solutions for the critical node problem
| 2016-07-29 | Paper |
Construction and improvement algorithms for dispersion problems
European Journal of Operational Research | 2016-07-08 | Paper |
Hybrid constructive heuristics for the critical node problem
Annals of Operations Research | 2016-04-20 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2015-01-22 | Paper |
A matheuristic approach for the two-machine total completion time flow shop problem
Annals of Operations Research | 2014-09-26 | Paper |
Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
Discrete Applied Mathematics | 2014-04-10 | Paper |
Branch and cut algorithms for detecting critical nodes in undirected graphs
Computational Optimization and Applications | 2013-02-18 | Paper |
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
Computers & Operations Research | 2012-11-15 | Paper |
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
Computers & Operations Research | 2012-11-15 | Paper |
Complexity of the critical node problem over trees
Computers & Operations Research | 2011-06-30 | Paper |
Simplex algorithms for linear programming
| 2011-03-09 | Paper |
Computational experience with a core-based reduction procedure for the 2-knapsack problem
Computers & Operations Research | 2010-10-15 | Paper |
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
Journal of Scheduling | 2010-05-07 | Paper |
Solving the problem of packing equal and unequal circles in a circular container
Journal of Global Optimization | 2010-05-07 | Paper |
Solving molecular distance geometry problems by global optimization algorithms
Computational Optimization and Applications | 2009-09-25 | Paper |
Finding maximin Latin hypercube designs by iterated local search heuristics
European Journal of Operational Research | 2009-04-30 | Paper |
A heuristic approach for the max-min diversity problem based on max-clique
Computers & Operations Research | 2009-04-03 | Paper |
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics | 2009-03-31 | Paper |
A ``maximum node clustering problem
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
An experimental analysis of a population based approach for global optimization
Computational Optimization and Applications | 2008-03-12 | Paper |
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Journal of Scheduling | 2007-12-20 | Paper |
A population-based approach for hard global optimization problems based on dissimilarity measures
Mathematical Programming. Series A. Series B | 2007-05-10 | Paper |
A new decomposition approach for the single machine total tardiness scheduling problem
The Journal of the Operational Research Society | 2005-01-19 | Paper |
An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
Operations Research Letters | 2004-07-01 | Paper |
Finding the Pareto-optima for the total and maximum tardiness single machine problem
Discrete Applied Mathematics | 2002-12-02 | Paper |
Optimal facility location with random throughput costs
Computers & Operations Research | 2002-04-03 | Paper |
Algorithmic paradoxes of the single-machine total tardiness problem
Journal of Scheduling | 2001-07-12 | Paper |
Solution of the single machine total tardiness problem
Journal of Scheduling | 2001-07-08 | Paper |
Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server
| N/A | Paper |
