| Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications | 0 | 0.34 | 2022 |
| A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. | 1 | 0.35 | 2019 |
| 14th Cologne-Twente Workshop on Graphs and CombinatorialOptimization (CTW 2016). | 0 | 0.34 | 2019 |
| A Branch-And-Bound Algorithm For The Prize-Collecting Single-Machine Scheduling Problem With Deadlines And Total Tardiness Minimization | 2 | 0.37 | 2018 |
| On edge-aware path-based color spatial sampling for Retinex: from Termite Retinex to Light Energy-driven Termite Retinex. | 5 | 0.48 | 2017 |
| Floor plan design and automatic nodes deployment for indoor location and monitoring systems. | 0 | 0.34 | 2016 |
| Partitioning a graph into minimum gap components | 0 | 0.34 | 2016 |
| Multimode extensions of Combinatorial Optimization problems | 0 | 0.34 | 2016 |
| The Prize-collecting Scheduling Problem with Deadlines | 0 | 0.34 | 2016 |
| The multimode covering location problem | 9 | 0.64 | 2016 |
| Preemption-aware planning on big-data systems. | 0 | 0.34 | 2016 |
| Construction and improvement algorithms for dispersion problems. | 8 | 0.51 | 2015 |
| A branch and bound approach for the design of decentralized supervisors in Petri net models | 13 | 0.51 | 2015 |
| A variable neighborhood search algorithm for the multimode set covering problem | 3 | 0.39 | 2015 |
| Column-generation based bounds for the Homogeneous Areas Problem. | 1 | 0.37 | 2014 |
| Decentralized Monitors Design for Petri Net Models. | 0 | 0.34 | 2014 |
| Employee workload balancing by graph partitioning. | 1 | 0.36 | 2014 |
| Balanced compact clustering for efficient range queries in metric spaces. | 2 | 0.41 | 2014 |
| Optimal selection of contracts and work shifts in multi-skill call centers | 0 | 0.34 | 2014 |
| Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms. | 14 | 0.63 | 2013 |
| An integer optimization approach for reverse engineering of gene regulatory networks | 3 | 0.42 | 2013 |
| Parsimonious Monitor Control of Petri Net Models of Flexible Manufacturing Systems | 22 | 0.72 | 2013 |
| Compact and decentralized supervisors for general constraint enforcement in Petri net models | 2 | 0.39 | 2013 |
| A GRASP metaheuristic for microarray data analysis | 3 | 0.42 | 2013 |
| Solving the Quadratic Minimum Spanning Tree Problem. | 17 | 1.08 | 2012 |
| Upper and Lower Bounds for the Homogeneous Areas Problem. | 0 | 0.34 | 2012 |
| A Lagrangian Relaxation Approach for Gene Regulatory Networks. | 0 | 0.34 | 2011 |
| Comparing local search metaheuristics for the maximum diversity problem | 21 | 0.86 | 2011 |
| Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints | 0 | 0.34 | 2010 |
| Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location | 0 | 0.34 | 2009 |
| Efficient deadlock prevention in Petri nets through the generation of selected siphons | 1 | 0.37 | 2009 |
| Balanced Clustering for Efficient Detection of Scientific Plagiarism | 0 | 0.34 | 2009 |
| Partitioning and scheduling of task graphs on partially dynamically reconfigurable FPGAs | 14 | 0.70 | 2009 |
| Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets | 61 | 1.41 | 2009 |
| Solving the swath segment selection problem through Lagrangean relaxation | 0 | 0.34 | 2008 |
| On Projecting Sums of Products | 5 | 0.65 | 2008 |
| The optimization of kEP-SOPs: Computational complexity, approximability and experiments | 3 | 0.52 | 2008 |
| A Relax-and-Cut Algorithm for the Knapsack Node Weighted Steiner Tree Problem | 1 | 0.35 | 2008 |
| Tabu Search versus GRASP for the maximum diversity problem | 22 | 1.01 | 2008 |
| A Modified Algorithm for Perceived Contrast Measure in Digital Images. | 7 | 0.78 | 2008 |
| Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem | 2 | 0.50 | 2008 |
| An approximation algorithm for fully testable kEP-SOP networks | 3 | 0.43 | 2007 |
| A subexponential algorithm for the coloured tree partition problem | 1 | 0.37 | 2007 |
| Using speculative computation and parallelizing techniques to improve scheduling of control based designs | 5 | 0.48 | 2006 |
| Logic Synthesis Of Exor Projected Sum Of Products | 0 | 0.34 | 2006 |
| An exact algorithm for the node weighted Steiner tree problem | 2 | 0.46 | 2006 |
| On the complexity of graph tree partition problems | 13 | 0.88 | 2004 |
| The Multicommodity Multilevel Bottleneck Assignment Problem | 4 | 0.44 | 2004 |
| The demand-dependent optimization of regular train timetables | 6 | 0.63 | 2004 |
| Coloured Ant System and Local Search to Design Local Telecommunication Networks | 3 | 0.38 | 2001 |
