A New Heuristic Algorithm for the Planar Minimum Covering Circle Problem

Production and Manufacturing Research - United Kingdom
doi 10.1080/21693277.2014.895917
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

A Heuristic for the Minimum Cost Chromatic Partition Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2020English

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

A New Heuristic Algorithm to Solve the Maximum Independent Set Problem

Mathematical and Computational Applications
2013English

Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem

iBusiness
2010English

A New Prioritizing-Stacking Heuristic Algorithm for the Inner-City Truck Loading Problem

International Journal of Business and Management
2013English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

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

A Combinational Heuristic Algorithm for the Three-Dimensional Packing Problem

Ruan Jian Xue Bao/Journal of Software
Software
2007English

HMEC: A Heuristic Algorithm for Individual Haplotyping With Minimum Error Correction

ISRN Bioinformatics
2013English

A Tabu-Search Based Heuristic for the Hub Covering Problem Over Incomplete Hub Networks

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy