𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On local optima in multiobjective combinatorial optimization problems

✍ Scribed by Luis Paquete; Tommaso Schiavinotto; Thomas Stützle

Publisher
Springer US
Year
2007
Tongue
English
Weight
421 KB
Volume
156
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Equivalence and existence of weak Pareto
Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
✍ Lun Li; Jun Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 242 KB

In this work, a differentiable multiobjective optimization problem with generalized cone constraints is considered, and the equivalence of weak Pareto solutions for the problem and for its η-approximated problem is established under suitable conditions. Two existence theorems for weak Pareto solutio

On simple combinatorial optimization pro
On simple combinatorial optimization problems
✍ A.J. Hoffman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

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.