✦ LIBER ✦

New bounds and constraint propagation techniques for the clique partitioning problem

✍ Scribed by Jaehn, Florian; Pesch, Erwin

Book ID: 123252849
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 430 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Redundant constraints in the standard fo

Redundant constraints in the standard formulation for the clique partitioning problem

✍ Miyauchi, Atsushi; Sukegawa, Noriyoshi 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 249 KB

Constraint propagation techniques for th

Constraint propagation techniques for the disjunctive scheduling problem

✍ Ulrich Dorndorf; Erwin Pesch; Toàn Phan-Huy 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 470 KB

Constraint propagation is an elementary method for reducing the search space of combinatorial search and optimization problems which has become more and more important in the last decades. The basic idea of constraint propagation is to detect and remove inconsistent variable assignments that cannot

Lagrangian relaxation and pegging test f

Lagrangian relaxation and pegging test for the clique partitioning problem

✍ Noriyoshi Sukegawa, Yoshitsugu Yamamoto… 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 327 KB

The energy scheduling problem: Industria

The energy scheduling problem: Industrial case-study and constraint propagation techniques

✍ Artigues, Christian; Lopez, Pierre; Haït, Alain 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 546 KB

A New Lower Bound for the Set-Partitioni

A New Lower Bound for the Set-Partitioning Problem

✍ John, John Welliaveetil 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 995 KB

A branch and bound algorithm for the max

A branch and bound algorithm for the maximum clique problem

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB