✦ LIBER ✦

Convex Combinatorial Optimization

✍ Scribed by Shmuel Onn; Uriel G. Rothblum

Publisher: Springer
Year: 2004
Tongue: English
Weight: 222 KB
Volume: 32
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-004-1138-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex hulls of orbits of representation

Convex hulls of orbits of representations of finite groups and combinatorial optimization

✍ A. I. Barvinok; A. M. Vershik 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 167 KB

Minmax combinatorial optimization

✍ Abraham P. Punnen; Y.P. Aneja 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Combinatorial representation and convex

Combinatorial representation and convex dimension of convex geometries

✍ Paul H. Edelman; Michael E. Saks 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 575 KB

Combinatorial Complexity of Convex Seque

Combinatorial Complexity of Convex Sequences

✍ Alex Iosevich; S. Konyagin; M. Rudnev; V. Ten 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 270 KB

Quasi-convex optimization

✍ Vasant A. Ubhaya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Given a bounded real function f defined on a closed bounded real interval/, the problem is to find a quasi-convex function f' so as to minimize the supremum of If(s)-f'(s)] for all s in L over the class of all quasi-convex functions f' on L This article obtains optimal solutions to the problem and d

Convex programming for disjunctive conve

Convex programming for disjunctive convex optimization

✍ Sebastián Ceria; João Soares 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 148 KB