𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new dominance procedure for combinatorial optimization problems

✍ Scribed by Matteo Fischetti; Paolo Toth

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
693 KB
Volume
7
Category
Article
ISSN
0167-6377

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

Easy distributions for combinatorial opt
Easy distributions for combinatorial optimization problems with probabilistic constraints
✍ Bernard Fortz; Michael Poss πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 232 KB

We show how we can linearize individual probabilistic linear constraints with binary variables when all coefficients are independently distributed according to either N (Β΅ i , λ¡ i ), for some Ξ» > 0 and Β΅ i > 0, or Ξ“ (k i , ΞΈ ) for some ΞΈ > 0 and k i > 0. The constraint can also be linearized when t