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

4OR - Germany
doi 10.1007/s10288-018-0377-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

Optimization Letters
ControlOptimization
2014English

An Optimal Algorithm for the Minimum Disc Cover Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

A Branch-And-Price Algorithm for the Long-Term Home Care Scheduling Problem

Operations Research Proceedings 2011
2012English

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

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

Multifactorial Evolutionary Algorithm for Clustered Minimum Routing Cost Problem

2019English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

Robust Branch-Cut-And-Price for the Capacitated Minimum Spanning Tree Problem Over a Large Extended Formulation

Mathematical Programming, Series B
MathematicsSoftware
2006English

The Clique Problem in Intersection Graphs of Ellipses and Triangles

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2005English

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

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy