✦ LIBER ✦

On simple combinatorial optimization problems

✍ Scribed by A.J. Hoffman

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 228 KB
Volume: 106-107
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90555-t

No coin nor oath required. For personal study only.

✦ Synopsis

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.

📜 SIMILAR VOLUMES

On metaheuristic algorithms for combinat

On metaheuristic algorithms for combinatorial optimization problems

✍ Mutsunori Yagiura; Toshihide Ibaraki 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 2 views

MOSA method: a tool for solving multiobj

MOSA method: a tool for solving multiobjective combinatorial optimization problems

✍ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie

Approximating the nondominated frontiers

Approximating the nondominated frontiers of multi-objective combinatorial optimization problems

✍ Murat Köksalan; Banu Lokman 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

Global optimization of a combinatorially

Global optimization of a combinatorially complex generalized pooling problem

✍ Clifford A. Meyer; Christodoulos A. Floudas 📂 Article 📅 2006 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 157 KB 👁 2 views

Combinatorial optimization problems in t

Combinatorial optimization problems in the analysis and design of probabilistic networks

✍ D. Bauer; F. Boesch; C. Suffel; R. Tindell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)

On a problem in combinatorial geometry

✍ Vojtěch Rödl 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Let us fix a number a, O< a < 2. We join two p0int.s on the unit sphere Sm in the real m-space iff their distance is a. Denote the obtained graph by g,,,. We prove that the chromatic number x(9@,,,) tends to infinity when m --+ a. This gives a positive answer to a question of P. Erdiis.