✦ LIBER ✦

Lower bounds and modified LPT algorithm fork-partitioning problems with partition matroid constraint

✍ Scribed by Biao Wu; En-yu Yao

Book ID: 107500817
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2008
Tongue: English
Weight: 157 KB
Volume: 23
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-008-0101-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for(k)-partitio

✍ Weidong Li, Jianping Li 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 174 KB

Lagrangean relaxation for a lower bound

✍ Ruy Eduardo Campello; Nelson F. Maculan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 925 KB

A branch and bound algorithm with constr

✍ Jeffrey L. Arthur; A. Ravindran 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 346 KB

A Complementarity-based Partitioning and

✍ Joaquim J. Júdice; Hanif D. Sherali; Isabel M. Ribeiro; Ana M. Faustino 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 213 KB

An Integer Linear Programming Problem wi

✍ Jun Li; Yong Shi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 362 KB