✦ LIBER ✦

A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders

✍ Scribed by R. Becker; I. Lari; M. Lucertini; B. Simeone

Publisher: Springer
Year: 2001
Tongue: English
Weight: 434 KB
Volume: 34
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-001-0008-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for solving a gen

A polynomial algorithm for solving a general max-min fairness problem

✍ Tomaszewski, Artur 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB

A polynomial-time algorithm for reducing

A polynomial-time algorithm for reducing the number of variables in MAX SAT problem

✍ Shaohan Ma; Dongmin Liang 📂 Article 📅 1997 🏛 SP Science China Press 🌐 English ⚖ 570 KB

A polynomial-time optimization algorithm

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation

✍ Maharaj Mukherjee; Kanad Chakraborty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A superlinearly convergent constrained m

A superlinearly convergent constrained min-max algorithm for rival models of the same system

✍ B. Rustem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 729 KB

In the presence of rival models of the same economic system, an optimal policy can be computed that takes account of the existence of all the models. A min-max, worst-case design, problem is formulated and subsequently restated as an alternative min-max problem. A numerical example of this approach

A polynomial time algorithm for finding

A polynomial time algorithm for finding the absolute center of a network

✍ Edward Minieka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

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