✦ LIBER ✦

Efficient branch-and-bound algorithms for weighted MAX-2-SAT

✍ Scribed by Toshihide Ibaraki; Takashi Imamichi; Yuichi Koga; Hiroshi Nagamochi; Koji Nonobe; Mutsunori Yagiura

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 509 KB
Volume: 127
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-009-0285-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for the min

A branch-and-bound algorithm for the mini-max spanning forest problem

✍ Takeo Yamada; Hideo Takahashi; Seiji Kataoka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 657 KB

The mini-max spanning forest problem requires to find a spanning forest of an undirected graph that minimizes the maximum of the costs of constituent trees. In a previous work we proved this problem NP-hard. In the current paper we present three lower bounds for this problem and develop a branch-and

A more efficient branch and bound algori

A more efficient branch and bound algorithm for feature selection

✍ Bin Yu; Baozong Yuan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB

An efficient load balancing strategy for

An efficient load balancing strategy for grid-based branch and bound algorithm

✍ M. Mezmaz; N. Melab; E.-G. Talbi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 286 KB

The most popular parallelization approach of the branch and bound algorithm consists in building and exploring in parallel the search tree representing the problem being tackled. The deployment of such parallel model on a grid rises the crucial issue of dynamic load balancing. The major question is

A branch-and-bound parallel algorithm fo

A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem

✍ Mieczysław Wodecki 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB

Branch-and-bound and simulated annealing

Branch-and-bound and simulated annealing algorithms for a total weighted completion time scheduling with ready times and learning effect

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Juei-Chao Chen; Nae-Sheng Wang; Wen-Hung Wu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 211 KB

An efficient branch-and-bound algorithm

An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem

✍ Wei-Chang Yeh 📂 Article 📅 2001 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b