𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

✍ Scribed by Refael Hassin; Ariel Keinan

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
185 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The pilot method: A strategy for heurist
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
✍ Duin, Cees; VoοΏ½, Stefan πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 2 views

As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time

Efficient algorithms for locating the le
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
✍ Yaw-Ling Lin; Tao Jiang; Kun-Mao Chao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 306 KB

We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecutive subsequence of length at most U with the maximum sum and (ii) given a sequence of real numbers of length n and a low

Fast scaling algorithms for M-convex fun
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem
✍ Akiyoshi Shioura πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 256 KB

M-convex functions, introduced by Murota (Adv. Math. 124 (1996) 272; Math. Prog. 83 (1998) 313), enjoy various desirable properties as "discrete convex functions." In this paper, we propose two new polynomial-time scaling algorithms for the minimization of an M-convex function. Both algorithms apply