✦ LIBER ✦

Set partitioning based heuristics for interactive routing

✍ Scribed by Frank H. Cullen; John J. Jarvis; H. Donald Ratliff

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 880 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A set-partitioning-based exact algorithm

A set-partitioning-based exact algorithm for the vehicle routing problem

✍ Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 899 KB

Set partitioning and column generation h

Set partitioning and column generation heuristics for capacitated dynamic lotsizing

✍ Dirk Cattrysse; Johan Maes; Luk N. Van Wassenhove 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 743 KB

A set partitioning heuristic for the gen

A set partitioning heuristic for the generalized assignment problem

✍ Dirk.G. Cattrysse; Marc Salomon; Luk N. Van Wassenhove 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Improvement heuristics for the Vehicle R

Improvement heuristics for the Vehicle Routing Problem based on simulated annealing

✍ Alex Van Breedam 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 802 KB

Efficient heuristic algorithms for path-

Efficient heuristic algorithms for path-based hardware/software partitioning

✍ Jigang Wu; Thambipillai Srikanthan; Ting Lei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Genetic algorithm-based feature set part

Genetic algorithm-based feature set partitioning for classification problems

✍ Lior Rokach 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 375 KB

Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a single useful subset of features. This paper presents a novel feature set partitioning approach that is based on a geneti