This paper addresses integer programming problems under probabilistic constraints involving discrete distributions. Such problems can be reformulated as large scale integer problems with knapsack constraints. For their solution we propose a specialized Branch and Bound approach where the feasible solutions of the knapsack constraint are used as partitioning rules of the feasible domain. The numerical experience carried out on a set covering problem with random covering matrix shows the validity of the solution approach and the efficiency of the implemented algorithm.
AN EXACT APPROACH FOR SOLVING INTEGER PROBLEMS UNDER PROBABILISTIC CONSTRAINTS WITH RANDOM TECHNOLOGY MATRIX / Bruni, Maria Elena; Beraldi, P.. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - 177:1(2010), pp. 127-138.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | AN EXACT APPROACH FOR SOLVING INTEGER PROBLEMS UNDER PROBABILISTIC CONSTRAINTS WITH RANDOM TECHNOLOGY MATRIX |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
Citazione: | AN EXACT APPROACH FOR SOLVING INTEGER PROBLEMS UNDER PROBABILISTIC CONSTRAINTS WITH RANDOM TECHNOLOGY MATRIX / Bruni, Maria Elena; Beraldi, P.. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - 177:1(2010), pp. 127-138. |
Handle: | http://hdl.handle.net/20.500.11770/133303 |
Appare nelle tipologie: | 1.1 Articolo in rivista |