2025
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits.
Int. Trans. Oper. Res., May, 2025
2024
Efficient Adaptive Large Neighborhood Search for Sensor-Weapon-Target Assignment.
IEEE Trans. Syst. Man Cybern. Syst., October, 2024
An effective hybrid search method for the quadratic knapsack problem with conflict graphs.
J. Oper. Res. Soc., May, 2024
A hybrid genetic algorithm for the Hamiltonian <i>p</i>-median problem.
Networks, March, 2024
Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach.
Expert Syst. Appl., March, 2024
An effective hybrid evolutionary algorithm for the clustered orienteering problem.
Eur. J. Oper. Res., March, 2024
A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment.
Eur. J. Oper. Res., January, 2024
Deinterleaving of Discrete Renewal Process Mixtures With Application to Electronic Support Measures.
IEEE Trans. Signal Process., 2024
An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints.
Knowl. Based Syst., 2024
A knowledge-based iterated local search for the weighted total domination problem.
Inf. Sci., 2024
Detecting Critical Nodes in Sparse Graphs via "Reduce-Solve-Combine" Memetic Search.
INFORMS J. Comput., 2024
Heuristic Search for Rank Aggregation with Application to Label Ranking.
INFORMS J. Comput., 2024
Solving the patient admission scheduling problem using constraint aggregation.
Eur. J. Oper. Res., 2024
Multi-objective general variable neighborhood search for software maintainability optimization.
Eng. Appl. Artif. Intell., 2024
An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem.
CoRR, 2024
Learning-guided iterated local search for the minmax multiple traveling salesman problem.
CoRR, 2024
A Multi-population Integrated Approach for Capacitated Location Routing.
CoRR, 2024
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver.
CoRR, 2024
A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem.
Comput. Oper. Res., 2024
Exact and heuristic solution approaches for the Generalized Independent Set Problem.
Comput. Oper. Res., 2024
Learning driven three-phase search for the maximum independent union of cliques problem.
Comput. Oper. Res., 2024
A large population island framework for the unconstrained binary quadratic problem.
Comput. Oper. Res., 2024
An effective memetic algorithm for the close-enough traveling salesman problem.
Appl. Soft Comput., 2024
Directed Acyclic Program Graph Applied to Supervised Classification.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2024
A Memetic Algorithm with Adaptive Operator Selection for Graph Coloring.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024
Breakout Local Search for Heaviest Subgraph Problem.
Proceedings of the Metaheuristics - 15th International Conference, 2024
Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver.
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
Hybrid genetic algorithm for undirected traveling salesman problems with profits.
Networks, October, 2023
Learning-based multi-start iterated local search for the profit maximization set covering problem.
Inf. Sci., October, 2023
A massively parallel evolutionary algorithm for the partial Latin square extension problem.
Comput. Oper. Res., October, 2023
Breakout local search for the traveling salesman problem with job-times.
Expert Syst. Appl., September, 2023
Solution-based tabu search for the capacitated dispersion problem.
Expert Syst. Appl., August, 2023
A fast tri-individual memetic search approach for the distance-based critical node problem.
Eur. J. Oper. Res., July, 2023
Memetic search for the minmax multiple traveling salesman problem with single and multiple depots.
Eur. J. Oper. Res., June, 2023
Solving the Single-Row Facility Layout Problem by K-Medoids Memetic Permutation Group.
IEEE Trans. Evol. Comput., April, 2023
General Edge Assembly Crossover-Driven Memetic Search for Split Delivery Vehicle Routing.
Transp. Sci., March, 2023
Dynamic thresholding search for the feedback vertex set problem.
PeerJ Comput. Sci., 2023
A double-decomposition based parallel exact algorithm for the feedback length minimization problem.
PeerJ Comput. Sci., 2023
Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres.
INFORMS J. Comput., 2023
Iterated hyperplane search for the budgeted maximum coverage problem.
Expert Syst. Appl., 2023
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem.
Eur. J. Oper. Res., 2023
An effective hybrid search algorithm for the multiple traveling repairman problem with profits.
Eur. J. Oper. Res., 2023
Combining Monte Carlo Tree Search and Heuristic Search for Weighted Vertex Coloring.
CoRR, 2023
Multi-wave tabu search for the boolean quadratic programming problem with generalized upper bound constraints.
Comput. Oper. Res., 2023
Iterated dynamic neighborhood search for packing equal circles on a sphere.
Comput. Oper. Res., 2023
A One-Vs-One Approach to Improve Tangled Program Graph Performance on Classification Tasks.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023
A Memetic Algorithm for Deinterleaving Pulse Trains.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
Monte Carlo Tree Search with Adaptive Simulation: A Case Study on Weighted Vertex Coloring.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2023
2022
Frequent Pattern-Based Search: A Case Study on the Quadratic Assignment Problem.
IEEE Trans. Syst. Man Cybern. Syst., 2022
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
IEEE Trans. Cybern., 2022
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization.
IEEE Trans. Computers, 2022
Dual Probability Learning Based Local Search for the Task Assignment Problem.
IEEE Trans Autom. Sci. Eng., 2022
Solving the clustered traveling salesman problem <i>via</i> traveling salesman problem methods.
PeerJ Comput. Sci., 2022
An adaptive memetic algorithm for the bidirectional loop layout problem.
Knowl. Based Syst., 2022
A deep learning guided memetic framework for graph coloring problems.
Knowl. Based Syst., 2022
Intensification-driven local search for the traveling repairman problem with profits.
Expert Syst. Appl., 2022
An effective branch-and-bound algorithm for the maximum s-bundle problem.
Eur. J. Oper. Res., 2022
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2022
Learning-driven feasible and infeasible tabu search for airport gate assignment.
Eur. J. Oper. Res., 2022
Iterated dynamic thresholding search for packing equal circles into a circular container.
Eur. J. Oper. Res., 2022
Heuristic Search for Rank Aggregation with Application to Label Ranking.
CoRR, 2022
Hybrid search with neighborhood reduction for the multiple traveling salesman problem.
Comput. Oper. Res., 2022
Multi-neighborhood simulated annealing for personalized user project planning.
Appl. Soft Comput., 2022
On Monte Carlo Tree Search for Weighted Vertex Coloring.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022
2021
Variable Population Memetic Search: A Case Study on the Critical Node Problem.
IEEE Trans. Evol. Comput., 2021
Population-based gradient descent weight learning for graph coloring problems.
Knowl. Based Syst., 2021
Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering.
Inf. Sci., 2021
Iterated multilevel simulated annealing for large-scale graph conductance minimization.
Inf. Sci., 2021
Grouping memetic search for the colored traveling salesmen problem.
Inf. Sci., 2021
Kernel based tabu search for the Set-union Knapsack Problem.
Expert Syst. Appl., 2021
Probability learning based tabu search for the budgeted maximum coverage problem.
Expert Syst. Appl., 2021
User project planning in social and medico-social sector: Models and solution methods.
Expert Syst. Appl., 2021
Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping.
Eur. J. Oper. Res., 2021
Iterated two-phase local search for the colored traveling salesmen problem.
Eng. Appl. Artif. Intell., 2021
Massively parallel hybrid search for the partial Latin square extension problem.
CoRR, 2021
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem.
Comput. Oper. Res., 2021
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering.
Comput. Oper. Res., 2021
Computing maximum <i>k</i>-defective cliques in massive graphs.
Comput. Oper. Res., 2021
Parallel iterative solution-based tabu search for the obnoxious <i>p</i>-median problem.
Comput. Oper. Res., 2021
Multistart solution-based tabu search for the Set-Union Knapsack Problem.
Appl. Soft Comput., 2021
A solution-driven multilevel approach for graph coloring.
Appl. Soft Comput., 2021
Adverse Event Report Classification in Social and Medico-Social Sector.
Proceedings of the IEEE Symposium on Computers and Communications, 2021
2020
Memetic search for the equitable coloring problem.
Knowl. Based Syst., 2020
A new iterated local search algorithm for the cyclic bandwidth problem.
Knowl. Based Syst., 2020
Distance-guided local search.
J. Heuristics, 2020
A hybrid evolutionary algorithm for finding low conductance of large graphs.
Future Gener. Comput. Syst., 2020
The Time-dependent Electric Vehicle Routing Problem: Model and solution.
Expert Syst. Appl., 2020
A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem.
Expert Syst. Appl., 2020
Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem.
Expert Syst. Appl., 2020
Solving the Clustered Traveling Salesman Problem via TSP methods.
CoRR, 2020
General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem.
Comput. Oper. Res., 2020
Memetic search for composing medical crews with equity and efficiency.
Appl. Soft Comput., 2020
Meta-heuristics and Artificial Intelligence.
Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume II: AI Algorithms, 2020
2019
Solving the Latin Square Completion Problem by Memetic Graph Coloring.
IEEE Trans. Evol. Comput., 2019
Memetic Search for Identifying Critical Nodes in Sparse Graphs.
IEEE Trans. Cybern., 2019
Intensification-driven tabu search for the minimum differential dispersion problem.
Knowl. Based Syst., 2019
Hybrid evolutionary search for the traveling repairman problem with profits.
Inf. Sci., 2019
Iterated backtrack removal search for finding k-vertex-critical subgraphs.
J. Heuristics, 2019
Diversification-based learning in computing and optimization.
J. Heuristics, 2019
Iterated two-phase local search for the Set-Union Knapsack Problem.
Future Gener. Comput. Syst., 2019
Heuristic search to the capacitated clustering problem.
Eur. J. Oper. Res., 2019
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem.
Eur. J. Oper. Res., 2019
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs.
Eng. Appl. Artif. Intell., 2019
Dynamic thresholding search for minimum vertex cover in massive sparse graphs.
Eng. Appl. Artif. Intell., 2019
Gradient Descent based Weight Learning for Grouping Problems: Application on Graph Coloring and Equitable Graph Coloring.
CoRR, 2019
Multiple phase tabu search for bipartite boolean quadratic programming with partitioned variables.
Comput. Oper. Res., 2019
Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem.
Comput. Oper. Res., 2019
Lorenz dominance based algorithms to solve a practical multiobjective problem.
Comput. Oper. Res., 2019
An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem.
IEEE Access, 2019
A Study of Recombination Operators for the Cyclic Bandwidth Problem.
Proceedings of the Artificial Evolution, 2019
2018
Adaptive feasible and infeasible tabu search for weighted vertex coloring.
Inf. Sci., 2018
Solution-based tabu search for the maximum min-sum dispersion problem.
Inf. Sci., 2018
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem.
Inf. Sci., 2018
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs.
Eur. J. Oper. Res., 2018
Two phased hybrid local search for the periodic capacitated arc routing problem.
Eur. J. Oper. Res., 2018
Tabu search with feasible and infeasible searches for equitable coloring.
Eng. Appl. Artif. Intell., 2018
Improving probability learning based local search for graph coloring.
Appl. Soft Comput., 2018
Minimum sum coloring for large graphs with extraction and backward expansion search.
Appl. Soft Comput., 2018
A Diversification-based Quantum Particle Swarm Optimization Algorithm for the Multidimensional Knapsack Problem.
Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018
Diversification-driven Memetic Algorithm for the Maximum Diversity Problem.
Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018
2017
Opposition-Based Memetic Search for the Maximum Diversity Problem.
IEEE Trans. Evol. Comput., 2017
Swap-vertex based neighborhood for Steiner tree problems.
Math. Program. Comput., 2017
An iterated local search algorithm for the minimum differential dispersion problem.
Knowl. Based Syst., 2017
Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs.
Knowl. Based Syst., 2017
Path relinking for the vertex separator problem.
Expert Syst. Appl., 2017
R2-IBMOLS applied to a practical case of the multiobjective knapsack problem.
Expert Syst. Appl., 2017
PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem.
Eur. J. Oper. Res., 2017
When data mining meets optimization: A case study on the quadratic assignment problem.
CoRR, 2017
Towards Effective Exact Algorithms for the Maximum Balanced Biclique Problem.
CoRR, 2017
Combining tabu search and graph reduction to solve the maximum balanced biclique problem.
CoRR, 2017
Frequency-driven tabu search for the maximum s-plex problem.
Comput. Oper. Res., 2017
An effective iterated tabu search for the maximum bisection problem.
Comput. Oper. Res., 2017
An iterated "hyperplane exploration" approach for the quadratic knapsack problem.
Comput. Oper. Res., 2017
A multiple search operator heuristic for the max-k-cut problem.
Ann. Oper. Res., 2017
Algorithms for the minimum sum coloring problem: a review.
Artif. Intell. Rev., 2017
A fast heuristic algorithm for the critical node problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
On feasible and infeasible search for equitable graph coloring.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017
2016
Memetic Search for the Generalized Quadratic Multiple Knapsack Problem.
IEEE Trans. Evol. Comput., 2016
Combined neighborhood tabu search for community detection in complex networks.
RAIRO Oper. Res., 2016
An evolutionary path relinking approach for the quadratic multiple knapsack problem.
Knowl. Based Syst., 2016
The bi-objective quadratic multiple knapsack problem: Model and heuristics.
Knowl. Based Syst., 2016
A three-phased local search approach for the clique partitioning problem.
J. Comb. Optim., 2016
Solving the maximum vertex weight clique problem via binary quadratic programming.
J. Comb. Optim., 2016
A clique-based exact method for optimal winner determination in combinatorial auctions.
Inf. Sci., 2016
Hybrid evolutionary search for the minimum sum coloring problem of graphs.
Inf. Sci., 2016
Reinforcement learning based local search for grouping problems: A case study on graph coloring.
Expert Syst. Appl., 2016
Iterated maxima search for the maximally diverse grouping problem.
Eur. J. Oper. Res., 2016
A hybrid metaheuristic approach for the capacitated arc routing problem.
Eur. J. Oper. Res., 2016
A learning-based path relinking algorithm for the bandwidth coloring problem.
Eng. Appl. Artif. Intell., 2016
Iterated variable neighborhood search for the capacitated clustering problem.
Eng. Appl. Artif. Intell., 2016
A tabu search based memetic algorithm for the max-mean dispersion problem.
Comput. Oper. Res., 2016
f-Flip strategies for unconstrained binary quadratic programming.
Ann. Oper. Res., 2016
2015
Effective Learning-Based Hybrid Search for Bandwidth Coloring.
IEEE Trans. Syst. Man Cybern. Syst., 2015
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints.
INFORMS J. Comput., 2015
Solving the winner determination problem via a weighted maximum clique heuristic.
Expert Syst. Appl., 2015
A multi-agent based optimization method applied to the quadratic assignment problem.
Expert Syst. Appl., 2015
Path relinking for the fixed spectrum frequency assignment problem.
Expert Syst. Appl., 2015
Memetic search for the quadratic assignment problem.
Expert Syst. Appl., 2015
A review on algorithms for maximum clique problems.
Eur. J. Oper. Res., 2015
Backtracking based iterated tabu search for equitable coloring.
Eng. Appl. Artif. Intell., 2015
General swap-based multiple neighborhood tabu search for the maximum independent set problem.
Eng. Appl. Artif. Intell., 2015
A three-phase search approach for the quadratic minimum spanning tree problem.
Eng. Appl. Artif. Intell., 2015
On memetic search for the max-mean dispersion problem.
CoRR, 2015
Identifying cancer-related microRNAs based on gene expression data.
Bioinform., 2015
Iterated responsive threshold search for the quadratic multiple knapsack problem.
Ann. Oper. Res., 2015
A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and Analysis.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015
Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2015
A Distributed Hybrid Algorithm for the Graph Coloring Problem.
Proceedings of the Artificial Evolution, 2015
2014
The unconstrained binary quadratic programming problem: a survey.
J. Comb. Optim., 2014
Pattern recognition in bioinformatics.
Neurocomputing, 2014
A memetic algorithm for discovering negative correlation biclusters of DNA microarray data.
Neurocomputing, 2014
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints.
Eur. J. Oper. Res., 2014
A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem.
Eur. J. Oper. Res., 2014
A tabu search based memetic algorithm for the maximum diversity problem.
Eng. Appl. Artif. Intell., 2014
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs.
CoRR, 2014
A Multi-parent Memetic Algorithm for the Linear Ordering Problem.
CoRR, 2014
Path Relinking for Bandwidth Coloring Problem.
CoRR, 2014
A note on a sports league scheduling problem.
CoRR, 2014
A memetic algorithm for the Minimum Sum Coloring Problem.
Comput. Oper. Res., 2014
In silico evaluation of the influence of the translocon on partitioning of membrane segments.
BMC Bioinform., 2014
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming.
Appl. Soft Comput., 2014
Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014
2013
Hybrid Metaheuristics for the Graph Partitioning Problem.
Proceedings of the Hybrid Metaheuristics, 2013
Recent Advances in Graph Vertex Coloring.
Proceedings of the Handbook of Optimization - From Classical to Modern Approach, 2013
An adaptive multistart tabu search approach to solve the maximum clique problem.
J. Comb. Optim., 2013
Backbone guided tabu search for solving the UBQP problem.
J. Heuristics, 2013
Solving large scale Max Cut problems via tabu search.
J. Heuristics, 2013
A hybrid metaheuristic method for the Maximum Diversity Problem.
Eur. J. Oper. Res., 2013
Breakout Local Search for the Max-Cutproblem.
Eng. Appl. Artif. Intell., 2013
Solving the minimum sum coloring problem via binary quadratic programming
CoRR, 2013
Improved Lower Bounds for Sum Coloring via Clique Decomposition
CoRR, 2013
Memetic search for the max-bisection problem.
Comput. Oper. Res., 2013
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem.
Comput. Oper. Res., 2013
Breakout Local Search for maximum clique problems.
Comput. Oper. Res., 2013
NARROMI: a noise and redundancy reduction technique improves accuracy of gene regulatory network inference.
Bioinform., 2013
Solving bi-objective flow shop problem with hybrid path relinking algorithm.
Appl. Soft Comput., 2013
An Extraction and Expansion Approach for Graph Coloring.
Asia Pac. J. Oper. Res., 2013
Informed Reactive Tabu Search for Graph Coloring.
Asia Pac. J. Oper. Res., 2013
Breakout local search for the quadratic assignment problem.
Appl. Math. Comput., 2013
Breakout Local Search for the Vertex Separator Problem.
Proceedings of the IJCAI 2013, 2013
A Study of Adaptive Perturbation Strategy for Iterated Local Search.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013
Hypervolume-Based Multi-Objective Path Relinking Algorithm.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2013
A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem.
Proceedings of the Artificial Evolution, 2013
Improving the Louvain Algorithm for Community Detection with Modularity Maximization.
Proceedings of the Artificial Evolution, 2013
2012
Memetic Algorithms in Discrete Optimization.
Proceedings of the Handbook of Memetic Algorithms, 2012
Hypervolume-based multi-objective local search.
Neural Comput. Appl., 2012
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data.
Knowl. Based Syst., 2012
BicFinder: a biclustering algorithm for microarray data analysis.
Knowl. Inf. Syst., 2012
Path relinking for unconstrained binary quadratic programming.
Eur. J. Oper. Res., 2012
Adaptive neighborhood search for nurse rostering.
Eur. J. Oper. Res., 2012
Improving the extraction and expansion method for large graph coloring.
Discret. Appl. Math., 2012
An effective heuristic algorithm for sum coloring of graphs.
Comput. Oper. Res., 2012
Coloring large graphs based on independent set extraction.
Comput. Oper. Res., 2012
Identifying dysregulated pathways in cancers from pathway interaction networks.
BMC Bioinform., 2012
Pattern-driven neighborhood search for biclustering of microarray data.
BMC Bioinform., 2012
Inferring gene regulatory networks from gene expression data by path consistency algorithm based on conditional mutual information.
Bioinform., 2012
Adaptive memory-based local search for MAX-SAT.
Appl. Soft Comput., 2012
Multi-neighborhood tabu search for the maximum weight clique problem.
Ann. Oper. Res., 2012
A Study of Breakout Local Search for the Minimum Sum Coloring Problem.
Proceedings of the Simulated Evolution and Learning - 9th International Conference, 2012
A Genetic Algorithm for Scale-Based Translocon Simulation.
Proceedings of the Pattern Recognition in Bioinformatics, 2012
A Memetic Approach for the Max-Cut Problem.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012
A Memetic Algorithm for Community Detection in Complex Networks.
Proceedings of the Parallel Problem Solving from Nature - PPSN XII, 2012
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012
2011
A Multilevel Memetic Approach for Improving Graph k-Partitions.
IEEE Trans. Evol. Comput., 2011
Polynomial unconstrained binary optimisation - Part 2.
Int. J. Metaheuristics, 2011
Polynomial unconstrained binary optimisation - Part 1.
Int. J. Metaheuristics, 2011
Neighborhood analysis: a case study on curriculum-based course timetabling.
J. Heuristics, 2011
Lower bounds for the ITC-2007 curriculum-based course timetabling problem.
Eur. J. Oper. Res., 2011
An efficient algorithm for computing the distance between close partitions.
Discret. Appl. Math., 2011
An effective multilevel tabu search approach for balanced graph partitioning.
Comput. Oper. Res., 2011
Genetic Tabu search for robust fixed channel assignment under dynamic traffic data.
Comput. Optim. Appl., 2011
A simple and effective algorithm for the MaxMin diversity problem.
Ann. Oper. Res., 2011
The case for strategic oscillation.
Ann. Oper. Res., 2011
Hybrid Filter-Wrapper with a Specialized Random Multi-Parent Crossover Operator for Gene Selection and Classification Problems.
Proceedings of the Bio-Inspired Computing and Applications, 2011
Spacing memetic algorithms.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
Multi-Neighborhood Search for Discrimination of Signal Peptides and Transmembrane Segments.
Proceedings of the Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics, 2011
2010
A hybrid LDA and genetic algorithm for gene selection and classification of microarray data.
Neurocomputing, 2010
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition.
Int. J. Appl. Metaheuristic Comput., 2010
A Reinforced Tabu Search Approach for 2D Strip Packing.
Int. J. Appl. Metaheuristic Comput., 2010
A memetic algorithm for graph coloring.
Eur. J. Oper. Res., 2010
Adaptive Tabu Search for course timetabling.
Eur. J. Oper. Res., 2010
A hybrid metaheuristic approach to solving the UBQP problem.
Eur. J. Oper. Res., 2010
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring.
Comput. Oper. Res., 2010
A search space "cartography" for guiding graph coloring heuristics.
Comput. Oper. Res., 2010
Transit network timetabling and vehicle assignment for regulating authorities.
Comput. Ind. Eng., 2010
Advances in metaheuristics for gene selection and classification of microarray data.
Briefings Bioinform., 2010
Diversification-driven tabu search for unconstrained binary quadratic problems.
4OR, 2010
Iterated Local Search for Biclustering of Microarray Data.
Proceedings of the Pattern Recognition in Bioinformatics, 2010
A Study of Multi-parent Crossover Operators in a Memetic Algorithm.
Proceedings of the Parallel Problem Solving from Nature, 2010
Improving Timetable Quality in Scheduled Transit Networks.
Proceedings of the Trends in Applied Intelligent Systems, 2010
Tabu Search with Consistent Neighbourhood for Strip Packing.
Proceedings of the Trends in Applied Intelligent Systems, 2010
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010
A Study of Memetic Search with Multi-parent Combination for UBQP.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010
A Local Search Appproach for Transmembrane Segment and Signal Peptide Discrimination.
Proceedings of the Evolutionary Computation, 2010
2009
List-graph colouring for multiple depot vehicle scheduling.
Int. J. Math. Oper. Res., 2009
Iterated local search for the multiple depot vehicle scheduling problem.
Comput. Ind. Eng., 2009
A biclustering algorithm based on a Bicluster Enumeration Tree: application to DNA microarray data.
BioData Min., 2009
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem.
Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009
A memetic algorithm for gene selection and molecular classification of cancer.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009
A Memetic Algorithm for Phylogenetic Reconstruction with Maximum Parsimony.
Proceedings of the Evolutionary Computation, 2009
Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
A Critical Element-Guided Perturbation Strategy for Iterated Local Search.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
A Tabu Search Algorithm with Direct Representation for Strip Packing.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2009
2008
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
Fuzzy Logic for Elimination of Redundant Information of Microarray Data.
Genom. Proteom. Bioinform., 2008
An improved simulated annealing algorithm for bandwidth minimization.
Eur. J. Oper. Res., 2008
Using solution properties within an enumerative search to solve a sports league scheduling problem.
Discret. Appl. Math., 2008
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.
Comput. Oper. Res., 2008
Gene Selection for Microarray Data by a LDA-Based Genetic Algorithm.
Proceedings of the Pattern Recognition in Bioinformatics, 2008
Transit Network Re-timetabling and Vehicle Scheduling.
Proceedings of the Modelling, 2008
Simultaneous Vehicle and Crew Scheduling for Extra Urban Transports.
Proceedings of the New Frontiers in Applied Artificial Intelligence, 2008
SVM-Based Local Search for Gene Selection and Classification of Microarray Data.
Proceedings of the Bioinformatics Research and Development, 2008
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm.
Proceedings of the Artificial Intelligence: Methodology, 2008
2007
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company.
Comput. Ind. Eng., 2007
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
A Genetic Embedded Approach for Gene Selection and Classification of Microarray Data.
Proceedings of the Evolutionary Computation, 2007
A New Dynamic Programming Algorithm for Multiple Sequence Alignment.
Proceedings of the Combinatorial Optimization and Applications, 2007
A Study of Evaluation Functions for the Graph K-Coloring Problem.
Proceedings of the Artificial Evolution, 2007
A Study of Crossover Operators for Gene Selection of Microarray Data.
Proceedings of the Artificial Evolution, 2007
A Framework for Automatic Composition of RFQ Web Services.
Proceedings of the 2007 IEEE International Conference on Services Computing, 2007
2006
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem.
Evol. Comput., 2006
Web Services Composition.
Proceedings of the Semantic Web Services, Processes and Applications, 2006
A Distance-Based Information Preservation Tree Crossover for the Maximum Parsimony Problem.
Proceedings of the Parallel Problem Solving from Nature, 2006
A Refined Evaluation Function for the MinLA Problem.
Proceedings of the MICAI 2006: Advances in Artificial Intelligence, 2006
A Hybrid GA/SVM Approach for Gene Selection and Classification of Microarray Data.
Proceedings of the Applications of Evolutionary Computing, 2006
Sports League Scheduling: Enumerative Search for Prob026 from CSPLib.
Proceedings of the Principles and Practice of Constraint Programming, 2006
2005
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes.
RAIRO Oper. Res., 2005
A Heuristic Solution for a Driver-Vehicle Scheduling Problem.
Proceedings of the Operations Research Proceedings 2005, 2005
A Comparison of Memetic Recombination Operators for the MinLA Problem.
Proceedings of the MICAI 2005: Advances in Artificial Intelligence, 2005
Three Truth Values for the SAT and MAX-SAT Problems.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Selecting Web Services for Optimal Composition.
Proceedings of the ICWS 2005 Second International Workshop on Semantic and Dynamic Web Processes, 2005
Local Search for the Maximum Parsimony Problem.
Proceedings of the Advances in Natural Computation, First International Conference, 2005
Approaches of Web Services Composition - Comparison between BPEL4WS and OWL-S.
Proceedings of the ICEIS 2005, 2005
Memetic Algorithms for the MinLA Problem.
Proceedings of the Artificial Evolution, 2005
2004
A General Approach for Constraint Solving by Local Search.
J. Math. Model. Algorithms, 2004
A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of SPLib).
Discret. Appl. Math., 2004
An Improved Evaluation Function for the Bandwidth Minimization Problem.
Proceedings of the Parallel Problem Solving from Nature, 2004
Recherche locale dichotomique pour la résolution des CSP continus.
Proceedings of the Programmation en logique avec contraintes, 2004
2003
Une approche hybride pour l'optimisation multi-objectif sous contraintes.
Tech. Sci. Informatiques, 2003
Évolution + Adaptation = Résolution.
Tech. Sci. Informatiques, 2003
Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem.
J. Comb. Optim., 2003
Multi-period Channel Assignment.
Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003
Evolutionary Computing for the Satisfiability Problem.
Proceedings of the Applications of Evolutionary Computing, 2003
A Population and Interval Constraint Propagation Algorithm.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2003
Recombination Operators for Satisfiability Problems.
Proceedings of the Artificial Evolution, 2003
A Hybrid Evolutionary Algorithm for CSP.
Proceedings of the Artificial Evolution, 2003
2002
Métaheuristiques pour la classification de bouchons naturels en liège.
Rev. d'Intelligence Artif., 2002
A Dynamic Traffic Model for Frequency Assignment.
Proceedings of the Parallel Problem Solving from Nature, 2002
2001
Une approche hybride pour le sac à dos multidimensionnel en variables 0-1.
RAIRO Oper. Res., 2001
A Heuristic Approach for Antenna Positioning in Cellular Networks.
J. Heuristics, 2001
A "Logic-Constrained" Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite.
Comput. Optim. Appl., 2001
A Hybrid Approach for the 01 Multidimensional Knapsack problem.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001
Scatter Search for Graph Coloring.
Proceedings of the Artificial Evolution, 2001
SAT, Local Search Dynamics and Density of States.
Proceedings of the Artificial Evolution, 2001
2000
An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000
Solving the Sports League Scheduling Problem with Tabu Search.
Proceedings of the Local Search for Planning and Scheduling, 2000
A measure of combinational landscape difficulty for the Metropolis algorithm.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000
1999
Hybrid Evolutionary Algorithms for Graph Coloring.
J. Comb. Optim., 1999
Landscapes and the Maximal Constraint Satisfaction Problem.
Proceedings of the Artificial Evolution, 4th European Conference, 1999
1998
Tabu Search for Frequency Assignment in Mobile Radio Networks.
J. Heuristics, 1998
A New Genetic Local Search Algorithm for Graph Coloring.
Proceedings of the Parallel Problem Solving from Nature, 1998
1997
Tabu Search for Maximal Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997
1996
Constraint Handling in Evolutionary Search: A Case Study of the Frequency Assignment.
Proceedings of the Parallel Problem Solving from Nature, 1996
Empirical Studies of Heuristic Local Search for Constraint Solving.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996
1995
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems.
Proceedings of the Artificial Neural Nets and Genetic Algorithms, 1995
Study of Genetic Search for the Frequency Assignment Problem.
Proceedings of the Artificial Evolution, European Conference, 1995
1994
An Empirical Comparison of Two Evolutionary Methods for Satisfiability Problems.
Proceedings of the First IEEE Conference on Evolutionary Computation, 1994
A New Population-Based Method for Satisfiability Problems.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994
1992
Prototyping an Inconsistency Checking Tool for Software Process Models.
Proceedings of the SEKE'92, 1992
1991
A modular architecture for constraint logic programming.
Proceedings of the 19th annual conference on Computer Science, 1991
1990
Combining Partial Evaluation and Constraint Solving: A new approach to Constraint Logic Programming.
Proceedings of the SPLT'90, 1990