𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comparison of Lagrangian bounds for one class of generalized assignment problems

✍ Scribed by I. S. Litvinchev; S. Rangel

Book ID
110194890
Publisher
SP MAIK Nauka/Interperiodica
Year
2008
Tongue
English
Weight
174 KB
Volume
48
Category
Article
ISSN
0965-5425

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lagrangian heuristic for a class of the
Lagrangian heuristic for a class of the generalized assignment problems
✍ Igor Litvinchev; Miguel Mata; Socorro Rangel; Jania Saucedo πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 314 KB

A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latte

Optimization problems on general classes
Optimization problems on general classes of rearrangements
✍ F. Cuccu; G. Porru; S. Sakaguchi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 252 KB

This paper is concerned with maximization and minimization problems of the energy integral associated to p-Laplace equations depending on functions that belong to a class of rearrangements. We prove existence and uniqueness results, and present some features of optimal solutions. The radial case is