✦ LIBER ✦

A cutting-plane approach to the edge-weighted maximal clique problem

✍ Scribed by G. Dijkhuizen; U. Faigle

Book ID: 107992361
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 747 KB
Volume: 69
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90097-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extended formulation approach to the

An extended formulation approach to the edge-weighted maximal clique problem

✍ Kyungchul Park; Kyungsik Lee; Sungsoo Park 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 799 KB

Genetic algorithm in DNA computing: A so

Genetic algorithm in DNA computing: A solution to the maximal clique problem

✍ Yuan Li; Chen Fang; Qi Ouyang 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 451 KB

Bilevel multiplicative problems: A penal

Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm

✍ Herminia I. Calvete; Carmen Galé 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A Cut and Branch Approach for the Capaci

A Cut and Branch Approach for the Capacitatedp-Median Problem Based on Fenchel Cutting Planes

✍ Maurizio Boccia; Antonio Sforza; Claudio Sterle; Igor Vasilyev 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 530 KB

Optimal clustering in graphs with weight

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a para

A new path-based cutting plane approach

A new path-based cutting plane approach for the discrete time-cost tradeoff problem

✍ Eleni Hadjiconstantinou; Evelina Klerides 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 299 KB