𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reduction Rules for the Covering Tour Problem

✍ Scribed by Luciene C.S. Motta; Luiz Satoru Ochi; Carlos A. Martinhon

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
277 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient algorithm for the Knight's
An efficient algorithm for the Knight's tour problem
✍ Ian Parberry πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 715 KB

It is easy to see that there is no closed knight's tour when n is odd since such a board has one more white square than black, or vice versa, and since the colours of the squares visited on a knight's tour must alternate.

Simple Lagrangian heuristic for the set
Simple Lagrangian heuristic for the set covering problem
✍ Salim Haddadi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 353 KB

In this paper a simple Lagrangian heuristic is proposed for the set covering problem. It is based on simple and classica1 ideas: Lagrangian duality, greedy heuristic for the set covering problem, subgradient optimization and redundant covers. The main interesting point of the paper lies in the fact