𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial algorithm for an integer quadratic non-separable transportation problem

✍ Scribed by Dorit S. Hochbaum; Ron Shamir; J. George Shanthikumar

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
728 KB
Volume
55
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A faster polynomial algorithm for the un
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
✍ Ulrich Brenner πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm

An approximation algorithm for quadratic
An approximation algorithm for quadratic cost 0–1 mixed integer programming problems
✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.