✦ LIBER ✦

The capacitated maxk-cut problem

✍ Scribed by Daya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 132 KB
Volume: 115
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-007-0139-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum to: The capacitated maxk-cut pro

Erratum to: The capacitated maxk-cut problem

✍ Daya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 81 KB

A new branch-and-cut algorithm for the c

A new branch-and-cut algorithm for the capacitated vehicle routing problem

✍ Jens Lysgaard; Adam N. Letchford; Richard W. Eglese 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 203 KB

Robust Branch-and-Cut-and-Price for the

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

✍ Ricardo Fukasawa; Humberto Longo; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

Capacitated selection problem

✍ Renato de Matta; Vernon Ning Hsu; Timothy J. Lowe 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types,

Capacitated Domination Problem

✍ Mong-Jen Kao; Chung-Shou Liao; D. T. Lee 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 808 KB

The capacitated plant location problem

✍ R. Sridharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 803 KB