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

Optimization Letters- Germany

doi 10.1007/s11590-014-0837-4

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

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

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

An Improved Bit Parallel Exact Maximum Clique Algorithm

Optimization Letters
ControlOptimization
2011English

A Branch & Bound Algorithm for the Open-Shop Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1997English

A Two-Stage Parallel Branch and Bound Algorithm for Mixed Integer Programs

IMA Journal of Management Mathematics
ManagementFinanceApplied MathematicsEconomicsSimulationManagement ScienceManagement Information SystemsModelingStrategyEconometricsOperations Research
2004English

A Branch & Price Algorithm for the Minimum Cost Clique Cover Problem in Max-Point Tolerance Graphs

4OR
MathematicsManagement ScienceManagement Information SystemsComputational TheoryOperations ResearchTheoretical Computer Science
2018English

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

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

A Complete Resolution of the Keller Maximum Clique Problem

2011English

A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy