✦ LIBER ✦

Approximate algorithms for the container loading problem

✍ Scribed by M. Hifi

Book ID: 119825171
Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 285 KB
Volume: 9
Category: Article
ISSN: 0969-6016
DOI: 10.1111/1475-3995.00386

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

LP-based bounds for the container and mu

LP-based bounds for the container and multi-container loading problem

✍ G. Scheithauer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB

LP-based bounds for the container and mu

LP-based bounds for the container and multi-container loading problem

✍ Guntram Scheithauer 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

New relaxations are developed in this paper for problems of optimal packing of small (rectangularshaped) pieces within one or several larger containers. Based on these relaxations tighter bounds for the Container Loading Problem (CLP) and the Multi-Container Loading Problem (MCLP) are obtained. The

An analytical model for the container lo

An analytical model for the container loading problem

✍ C.S. Chen; S.M. Lee; Q.S. Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Approximate algorithms for the travellin

Approximate algorithms for the travelling purchaser problem

✍ Hoon Liong Ong 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Approximate algorithms for the competiti

Approximate algorithms for the competitive facility location problem

✍ V. L. Beresnev; A. A. Mel’nikov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 552 KB

Approximate Algorithms for the 0/1 Knaps

Approximate Algorithms for the 0/1 Knapsack Problem

✍ Sahni, Sartaj 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 628 KB