✦ LIBER ✦

The bi-objective covering tour problem

✍ Scribed by Nicolas Jozefowiez; Frédéric Semet; El-Ghazali Talbi

Book ID: 108105719
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 216 KB
Volume: 34
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.07.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reduction Rules for the Covering Tour Pr

Reduction Rules for the Covering Tour Problem

✍ Luciene C.S. Motta; Luiz Satoru Ochi; Carlos A. Martinhon 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Two-phase method and Lagrangian relaxati

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

✍ Christian Prins; Caroline Prodhon; Roberto Wolfler Calvo 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 532 KB

Metaheuristics for the bi-objective orie

Metaheuristics for the bi-objective orienteering problem

✍ Michael Schilde; Karl F. Doerner; Richard F. Hartl; Guenter Kiechle 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 417 KB

The median tour and maximal covering tou

The median tour and maximal covering tour problems: Formulations and heuristics

✍ John R. Current; David A. Schilling 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 941 KB

A bi-objective uncapacitated facility lo

A bi-objective uncapacitated facility location problem

✍ Young-Soo Myung; Hu-gon Kim; Dong-wan Tcha 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result