✦ LIBER ✦

Optimization via enumeration: a new algorithm for the Max Cut Problem

✍ Scribed by Anna Galluccio; Martin Loebl; Jan Vondrák

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 163 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011425

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Continuation Algorithm for Max-Cut Pro

A Continuation Algorithm for Max-Cut Problem

✍ Feng Min Xu; Cheng Xian Xu; Xing Si Li 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 160 KB

Optimization and optimality test for the

Optimization and optimality test for the Max-Cut Problem

✍ Chr Hohmann; W. Kern 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 510 KB

A new scaling algorithm for the maximum

A new scaling algorithm for the maximum mean cut problem

✍ Kazuo Iwano; Shinji Misono; Shu Tezuka; Satoru Fujishige 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 673 KB

Efficient Algorithms for the Problems of

Efficient Algorithms for the Problems of Enumerating Cuts by Non-decreasing Weights

✍ Li-Pu Yeh; Biing-Feng Wang; Hsin-Hao Su 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 651 KB

A discrete filled function algorithm for

A discrete filled function algorithm for approximate global solutions of max-cut problems

✍ Ai-Fan Ling; Cheng-Xian Xu; Feng-Min Xu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 245 KB

A discrete filled function algorithm is proposed for approximate global solutions of max-cut problems. A new discrete filled function is defined for max-cut problems and the properties of the filled function are studied. Unlike general filled function methods, using the characteristic of max-cut pro

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