✦ LIBER ✦

Implicit enumeration algorithms for the Set-Partitioning Problem

✍ Scribed by S. Albers

Publisher: Springer
Year: 1980
Tongue: German
Weight: 797 KB
Volume: 2
Category: Article
ISSN: 0171-6468
DOI: 10.1007/bf01720155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the complete

An efficient algorithm for the complete set partitioning problem

✍ Chien-Hua M. Lin; Harvey M. Salkin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A two-process implicit enumeration algor

A two-process implicit enumeration algorithm for the simple assembly line balancing problem

✍ Matthew J. Saltzman; Ilker Baybars 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 893 KB

On the Minimum Feedback Vertex Set Probl

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

✍ Fedor V. Fomin; Serge Gaspers; Artem V. Pyatkin; Igor Razgon 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 358 KB

Implicit enumeration based algorithms fo

Implicit enumeration based algorithms for postoptimizing zero-one programs

✍ Christopher J. Piper; Andris A. Zoltners 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 959 KB

An implicit enumeration scheme for the b

An implicit enumeration scheme for the batch selection problem

✍ A. Agnetis; F. Rossi; S. Smriglio 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract An important problem arising in the management of logistic networks is the following: given a set of activities to be performed, each requiring a set of resources, select the optimal set of resources compatible with the system capacity constraints. This problem is called Batch Selection

Linear compound algorithms for the parti

Linear compound algorithms for the partitioning problem

✍ Yong He; Hans Kellerer; Vladimir Kotov 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views