✦ LIBER ✦

Algorithm robust for the bicriteria discrete optimization problem

✍ Scribed by Panos Kouvelis; Serpil Sayın

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 342 KB
Volume: 147
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0062-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning tree-based genetic algorithm fo

Spanning tree-based genetic algorithm for bicriteria transportation problem

✍ Mitsuo Gen; Yin-Zhen Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 371 KB

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transport,ation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encodi

Algorithms for solving a separable probl

Algorithms for solving a separable problem of discrete optimization

✍ S.I. Sergeyev 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 128 KB

Bicriteria approximation algorithms for

Bicriteria approximation algorithms for scheduling problems with communications delays

✍ Evripidis Bampis; Alexander Kononov 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 244 KB

Robust Algorithms for the Stable Set Pro

Robust Algorithms for the Stable Set Problem

✍ Michael U. Gerber; Vadim V. Lozin 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 320 KB

On algorithms for discrete problems

✍ R.G. Jeroslow 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 631 KB

The paper presents a theorem, applicable to many algorithms used in integer programming, which states that, under frequently met hypotheses! arbitrarily close (in the topology on real space) to most "well-behaved"integer programs there exist integer programs for which the algorithm requires arbitrar

A problem reduction based approach to di

A problem reduction based approach to discrete optimization algorithm design

✍ Yujun Zheng; Jinyun Xue 📂 Article 📅 2010 🏛 Springer Vienna 🌐 English ⚖ 313 KB