✦ LIBER ✦

Studying properties of Lagrangian bounds for many-to-many assignment problems

✍ Scribed by I. Litvinchev; S. Rangel; M. Mata; J. Saucedo

Book ID: 111453816
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 319 KB
Volume: 48
Category: Article
ISSN: 1064-2307
DOI: 10.1134/s1064230709030046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lagrangian bound for many-to-many assi

A Lagrangian bound for many-to-many assignment problems

✍ Igor Litvinchev; Socorro Rangel; Jania Saucedo 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 385 KB

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

Comparison of Lagrangian bounds for one

Comparison of Lagrangian bounds for one class of generalized assignment problems

✍ I. S. Litvinchev; S. Rangel 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 174 KB

Decomposition of the reactive dynamic as

Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern

✍ Masao Kuwahara; Takashi Akamatsu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Properties of alpha-particle solutions t

Properties of alpha-particle solutions to the many-nucleon problem

✍ I. A. Gnilozub; S. D. Kurgalin; Yu. M. Tchuvil’sky 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 737 KB

System optimal dynamic traffic assignmen

System optimal dynamic traffic assignment: Properties and solution procedures in the case of a many-to-one network

✍ Shen, Wei; Zhang, H.M. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 923 KB