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

Optimization Letters - Germany
doi 10.1007/s11590-016-1055-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

MSClique: Multiple Structure Discovery Through the Maximum Weighted Clique Problem

PLoS ONE
Multidisciplinary
2016English

A Complete Resolution of the Keller Maximum Clique Problem

2011English

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

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

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

Clique Family Inequalities for the Stable Set Polytope of Quasi-Line Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Maximum of Green's Functions and Liapunov Inequalities for the Sturm-Liouville Problem

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2002English

New Heuristics for the Maximum Diversity Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy