𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A set covering reformulation of the pure fixed charge transportation problem

✍ Scribed by Maud Göthe-Lundgren; Torbjörn Larsson

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
891 KB
Volume
48
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacity improvement, penalties, and the
Capacity improvement, penalties, and the fixed charge transportation problem
✍ Gavin J. Bell; Bruce W. Lamar; Chris A. Wallace 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

Capacity improvement and conditional penalties are two computational aides for fathoming subproblems in a branch-and-bound procedure. In this paper, we apply these techniques to the fixed charge transportation problem (FCTP) and show how relaxations of the FCTP subproblems can be posed as concave mi

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,