✦ LIBER ✦

Solving fixed configuration problems with genetic search

✍ Scribed by Don R. Brown; Kuo-Yen Hwang

Book ID: 105441459
Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 725 KB
Volume: 5
Category: Article
ISSN: 0934-9839
DOI: 10.1007/bf02032577

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Musical constraint satisfaction problems

Musical constraint satisfaction problems solved with adaptive search

✍ C. Truchet; P. Codognet 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 244 KB

Solving transportation problems with non

Solving transportation problems with nonlinear side constraints with tabu search

✍ Buyang Cao; Götz Uebe 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 774 KB

Solving variational inequality and fixed

Solving variational inequality and fixed point problems by line searches and potential optimization

✍ Thomas L. Magnanti; Georgia Perakis 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 228 KB

A hybrid tabu search to solve the hetero

A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem

✍ Jalel Euchi; Habib Chabchoub 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 315 KB

Methods for solving the problems of sear

Methods for solving the problems of searching for a safe configuration of reactors

✍ A. M. Kuz'min; V. S. Okunev 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 470 KB

Solving fixed charge network problems wi

Solving fixed charge network problems with group theory-based penalties

✍ R. L. Rardin; V. E. Unger 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 926 KB

## Abstract Many well‐known transportation, communication, and facilities location problems in operations research can be formulated as fixed charge network problems, i.e. as minimum cost flow problems on a capacitated network in one commodity where some arcs have both fixed and variable costs. One