✦ LIBER ✦

A class of web-based facets for the generalized vertex packing problem

✍ Scribed by Hanif D. Sherali; J. Cole Smith

Book ID: 108112493
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 230 KB
Volume: 146
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.09.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polyhedral study of the generalized ve

A polyhedral study of the generalized vertex packing problem

✍ Hanif D. Sherali; J. Cole Smith 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 252 KB

A class of generalized greedy algorithms

A class of generalized greedy algorithms for the multi-knapsack problem

✍ A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A general class of centers for the Poinc

A general class of centers for the Poincaré problem

✍ G.R. Nicklason 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 141 KB

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

Solution of the stability problem for a

Solution of the stability problem for a class of generalized volterra prey-predator systems

✍ Ray Redheffer; Wolfgang Walter 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 968 KB

A class of bush-based algorithms for the

A class of bush-based algorithms for the traffic assignment problem

✍ Yu (Marco) Nie 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 569 KB