Consolidating Maintenance Spares
Computational Optimization and Applications
A branch-and-price algorithm for the Steiner tree packing problem
Computers and Operations Research
Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
An approximate dynamic programming approach to convex quadratic knapsack problems
Computers and Operations Research
Finding optimal solutions to the graph partitioning problem with heuristic search
Annals of Mathematics and Artificial Intelligence
A hub location problem with fully interconnected backbone and access networks
Computers and Operations Research
The quadratic knapsack problem-a survey
Discrete Applied Mathematics
LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
An approximate dynamic programming approach to convex quadratic knapsack problems
Computers and Operations Research
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A novel quantum evolutionary algorithm for quadratic knapsack problem
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Maximum cut in fuzzy nature: Models and algorithms
Journal of Computational and Applied Mathematics
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A reactive GRASP with path relinking for capacitated clustering
Journal of Heuristics
Spectral clustering: A semi-supervised approach
Neurocomputing
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
SIAM Journal on Optimization
Spectral clustering with discriminant cuts
Knowledge-Based Systems
Graph partitioning via recurrent multivalued neural networks
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Computer Science Review
Cliques and clustering: A combinatorial approach
Operations Research Letters
An exact algorithm for IP column generation
Operations Research Letters
The quadratic 0-1 knapsack problem with series-parallel support
Operations Research Letters
A polyhedral study of the maximum edge subgraph problem
Discrete Applied Mathematics
Maximising the net present value of large resource-constrained projects
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
Computers and Operations Research
New bounds and constraint propagation techniques for the clique partitioning problem
Discrete Applied Mathematics
| Hi-index | 0.00 |