Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation

This article deals with the two-stage stochastic model, which aims at explicitly taking into account uncertainty in optimization problems, that Kong and Schaefer have recently studied for the maximum weight matching problem [N. Kong, A.J. Schaefer, A factor 1/2 approximation algorithm for two-stage...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research 2010-08, Vol.205 (1), p.19-30
Hauptverfasser:	Escoffier, Bruno, Gourvès, Laurent, Monnot, Jérôme, Spanjaard, Olivier
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Approximation Approximation algorithms Combinatorial optimization Computer Science Exact sciences and technology Flows in networks. Combinatorial problems Graph theory Heuristic Matching Mathematical programming Maximum spanning tree Operational research and scientific management Operational research. Management science Optimization algorithms Stochastic models Stochastic programming Stochastic programming Approximation algorithms Matching Maximum spanning tree Combinatorial optimization Studies Uncertainty
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!