✦ LIBER ✦

Application of a combinatorial method for solving the problem of constructing a time table

✍ Scribed by V. M. Portugal

Publisher: Springer US
Year: 1971
Tongue: English
Weight: 232 KB
Volume: 3
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071713

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Decomposition method of solving a class

Decomposition method of solving a class of combinatorial optimization problems

✍ V. L. Kravets; I. V. Sergienko 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 415 KB

A graphical realization of the dynamic p

A graphical realization of the dynamic programming method for solving -hard combinatorial problems

✍ Alexander A. Lazarev; Frank Werner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 656 KB

## a b s t r a c t In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the

Constructive method for solving a linear

Constructive method for solving a linear minimax problem of optimal control

✍ N. Chan 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 752 KB

The application of a minimization method

The application of a minimization method for solving reacting-distillation problems

✍ K. Alejski; J. Szymanowski; M. Bogacki 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Solving the nonlinear least square probl

Solving the nonlinear least square problem: Application of a general method

✍ J. T. Betts 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 795 KB