✦ LIBER ✦

A Branch-And-Price Algorithm for the Generalized Assignment Problem

✍ Scribed by Martin Savelsbergh

Book ID: 123687844
Publisher: INFORMS
Year: 1997
Tongue: English
Weight: 385 KB
Volume: 45
Category: Article
ISSN: 0030-364X
DOI: 10.2307/172068

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the gen

A branch and bound algorithm for the generalized assignment problem

✍ G. Terry Ross; Richard M. Soland 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

A column generation and branch-and-cut a

A column generation and branch-and-cut algorithm for the channel assignment problem

✍ Têkogan D. Hemazro; Brigitte Jaumard; Odile Marcotte 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A branch-and-price algorithm for a targe

A branch-and-price algorithm for a targeting problem

✍ Ojeong Kwon; Kyungsik Lee; Donghan Kang; Sungsoo Park 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 1 views

A (1–)-approximation algorithm for the g

A (1–)-approximation algorithm for the generalized assignment problem

✍ Zeev Nutov; Israel Beniaminy; Raphael Yuster 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 173 KB

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 1 2

A parallel branch and bound algorithm fo

A parallel branch and bound algorithm for the quadratic assignment problem

✍ Catherine Roucairol 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 746 KB

A branch-and-bound algorithm for the sin

A branch-and-bound algorithm for the singly constrained assignment problem

✍ P.M.D. Lieshout; A. Volgenant 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 211 KB