𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lagrangian bound for many-to-many assignment problems

✍ Scribed by Igor Litvinchev; Socorro Rangel; Jania Saucedo

Book ID
106407252
Publisher
Springer US
Year
2008
Tongue
English
Weight
385 KB
Volume
19
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds for nonlinear assignment pr
Lower bounds for nonlinear assignment problems using many body interactions
✍ Bala Ramachandran; J.F. Pekny πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 772 KB

This paper concerns lower bounding techniques for the general a-adic assignment problem. The nonlinear objective function is linearized by the introduction of additional variables and constraints, thus yielding a mixed integer linear programming formulation of the problem. The concept of many body i

Correlated wave-function theory for many
Correlated wave-function theory for many-center many-electron problems
✍ Dmitry A. Shershakov; Vladimir V. Nechaev πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 174 KB

The correlated electronic wave-function theory developed by S. Obara w Ε½ .x and K. Hirao Bull. Chem. Soc. Jpn. 66, 3300 1993 , as applied to two-electron molecular systems, is generalized to many-center many-electron problems. The exact formulas for effective Hamiltonian operators are given. The rul

Rete: A fast algorithm for the many patt
Rete: A fast algorithm for the many pattern/many object pattern match problem
✍ Charles L. Forgy πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 982 KB

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a f