✦ LIBER ✦

On the stability of some integer programming algorithms

✍ Scribed by M.V. Devyaterikova; A.A. Kolokolov

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 160 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some algorithms for solving non-linear i

Some algorithms for solving non-linear integer mathematical programming problems

✍ Y.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 455 KB

A greedy algorithm for some classes of i

A greedy algorithm for some classes of integer programs

✍ V.V. Shenmaier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

We establish a necessary and su cient condition for a greedy algorithm to ÿnd an optimal solution in the case of integer programs with separable concave objective functions. This extends some well-known results for spanning trees, matroids, and greedoids. As a corollary we obtain one new generalizat

The complexity of approximate algorithms

The complexity of approximate algorithms for the problem of integer programming

✍ N.N. Kuzyurin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 334 KB

Computer experiments on solving integer

Computer experiments on solving integer linear programming problems by locally stochastic algorithms

✍ V.A. Pir'yanovich 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 629 KB

Cutting plane algorithms for the inverse

Cutting plane algorithms for the inverse mixed integer linear programming problem

✍ Lizhi Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 677 KB

A Group of algorithms for solving quasil

A Group of algorithms for solving quasilinear problems of integer programming

✍ A.N. Zhernak 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 387 KB