Results 231 to 240 of about 335,404 (286)
Some of the next articles are maybe not open access.

Worst-Case Analysis of Heuristic Algorithms

Management Science, 1980
The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst-case approach to the analysis of heuristic performance.
exaly   +2 more sources

A Heuristic Scheduling Algorithm

Journal of the Operational Research Society, 1980
This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame of the schedule and the difference between the exogenously given number of people desired at each available location-activity-period position and those ...
Hosios, A. J., Rousseau, J. M.
openaire   +1 more source

Heuristic Algorithms

2012
This chapter approaches the Truck Loading Problem, which is formulated as a rich problem with the classic one dimensional Bin Packing Problem (BPP) and five variants. The literature review reveals that related work deals with three variants at the most.
Laura Cruz Reyes   +6 more
openaire   +1 more source

Heuristic Clustering Algorithms

2020
This chapter is devoted to the most popular heuristic partitional clustering algorithms such as k-means, k-medians, and k-medoids. In addition, we give an overview of some clustering algorithms based on mixture models, self-organizing map, and fuzzy clustering. The description of these algorithms as well as their flowcharts is presented.
Adil Bagirov   +2 more
openaire   +1 more source

Heuristics and Genetic Algorithms

INCOSE International Symposium, 2006
AbstractGenetic algorithms are design tools used in generating optimal solutions. While they can often be shown to outperform various heuristic methods and hybrid approaches, using a combination of evolutionary algorithms and heuristic approaches can generate an optimal solution more quickly than either of the two methods independently.
Michael D. Mobley   +2 more
openaire   +1 more source

A heuristic triangulation algorithm

Journal of Algorithms, 1987
We propose a heuristic triangulation algorithm. The algorithm runs in polynomial time and produces a triangulation within a ratio of O(log n) to the cost of an optimal triangulation of a set of n points in the Euclidean plane.
Plaisted, David A., Hong, Jiarong
openaire   +1 more source

On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs [PDF]

open access: possibleFundamenta Informaticae, 2014
In this paper we study heuristic proof systems and heuristic non-deterministic algorithms. We give an example of a language Y and a polynomial-time samplable distribution D such that the distributional problem (Y, D) belongs to the complexity class HeurNP but Y ∉ NP if NP ≠ coNP, and (Y, D) ∉ HeurBPP if (NP,PSamp) $\nsubseteq$ HeurBPP. For a language L
Itsykson, Dmitry, Sokolov, Dmitry
openaire   +1 more source

Optimization of Chemical Synthesis with Heuristic Algorithms

SSRN Electronic Journal, 2022
Heuristic algorithms have been used in optimizing cross-coupling yields.
Jialu Chen, Wenjun Xu, Ruiqin Zhang
openaire   +2 more sources

Algorithms, approximations, and heuristics

2001
This chapter, indeed the whole of this book, is based on three axioms: 1. Machine vision is an engineering discipline, not a mathematical or philosophical exercise. 2. There is no unique way to perform any given image-processing function; every algorithm can be implemented in many different ways. 3.
Bruce Batchelor, Frederick Waltz
openaire   +1 more source

Home - About - Disclaimer - Privacy