𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Experiments with a very efficient heuristic for clustering problems

✍ Scribed by Larry E. Stanfel

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
961 KB
Volume
4
Category
Article
ISSN
0959-2954

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient heuristic for the multi-ite
An efficient heuristic for the multi-item newsboy problem with a single constraint
✍ Steven Nahmias; Charles P. Schmidt πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici

A tabu search heuristic using genetic di
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
✍ Gilbert Laporte; Jean-Yves Potvin; Florence Quilleret πŸ“‚ Article πŸ“… 1997 πŸ› Springer US 🌐 English βš– 736 KB

The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian Cycle such that the vertices of each cluster are visited contiguously and the clusters are vi

Heuristic procedure for a multiproduct d
Heuristic procedure for a multiproduct dynamic lot-sizing problem with coordinated replenishments
✍ Chia-Shin Chung; H. Murat Mercan πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 840 KB

In this article we develop a heuristic procedure for a multiproduct dynamic lot-sizing problem. In this problem a joint setup cost is incurred when at least one product is ordered in a period. In addition to the joint setup cost a separate setup cost for each product ordered is also incurred. The ob