A Heuristic for the Minimum Cost Chromatic Partition Problem

RAIRO - Operations Research- France

doi 10.1051/ro/2019037

Full Text

Abstract

Available in

Date

Authors

Publisher

EDP Sciences

Related search

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem

Production and Manufacturing Research
IndustrialManufacturing Engineering
2014English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2005English

On the Minimum Common Integer Partition Problem

ACM Transactions on Algorithms
Mathematics
2008English

Inapproximability of the Minimum Biclique Edge Partition Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs

2007English

Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

An Integer Programming Formulation of the Minimum Common String Partition Problem

PLoS ONE
Multidisciplinary
2015English

Multifactorial Evolutionary Algorithm for Clustered Minimum Routing Cost Problem

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy