PUSH: A Generalized Operator for the Maximum Vertex Weight Clique Problem

European Journal of Operational Research - Netherlands
doi 10.1016/j.ejor.2016.07.056
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

A Complete Resolution of the Keller Maximum Clique Problem

2011English

R-Evo: A Reactive Evolutionary Algorithm for the Maximum Clique Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem

Optimization Letters
ControlOptimization
2014English

A New Family of Facet Defining Inequalities for the Maximum Edge-Weighted Clique Problem

Optimization Letters
ControlOptimization
2016English

MSClique: Multiple Structure Discovery Through the Maximum Weighted Clique Problem

PLoS ONE
Multidisciplinary
2016English

Np-Completeness and Approximation Algorithm for the Maximum Integral Vertex-Balanced Flow Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1991English

Approximating Maximum Clique With a Hopfield Network

IEEE Transactions on Neural Networks
1995English

Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy