✦ LIBER ✦

Decomposition method of solving a class of combinatorial optimization problems

✍ Scribed by V. L. Kravets; I. V. Sergienko

Publisher: Springer US
Year: 1984
Tongue: English
Weight: 415 KB
Volume: 19
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068574

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A decomposition algorithm for solving a

A decomposition algorithm for solving a class of optimal control problems

✍ G Meyer; E Polak 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

MOSA method: a tool for solving multiobj

MOSA method: a tool for solving multiobjective combinatorial optimization problems

✍ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie

A gradient method for solving a class of

A gradient method for solving a class of optimal control problems

✍ O.V. Vasil'ev 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 590 KB

A method of solving one class of integer

A method of solving one class of integer programming problems

✍ V.G. Anisimov; E.G. Anisimov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 332 KB

A method of solving the time-optimal pro

A method of solving the time-optimal problem

✍ P.A. Nepomyashchii 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 1021 KB

Convergence of a simulation method for s

Convergence of a simulation method for solution of combinatorial optimization problems

✍ L. F. Gulyanitskii; L. B. Koshlai; I. V. Sergienko 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 339 KB