𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximative algorithm for the fixed-charges transportation problem

✍ Scribed by Harold W. Kuhn; William J. Baumol

Publisher
John Wiley and Sons
Year
1962
Tongue
English
Weight
840 KB
Volume
9
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An integer programming algorithm for por
An integer programming algorithm for portfolio selection with fixed charges
✍ Mary W. Cooper; Keyvan Farhangian πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 262 KB

## Abstract A mean‐variance portfolio selection model with limited diversification is formulated in which transaction and management costs are incorporated as the sum of a linear cost and a fixed cost. The problem is a fixed charge integer programming problem solved by hypersurface search using dyn

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