Solving the geometric firefighter routing problem via integer programming

•New GFP variants that allow for more general sets of barriers and solutions.•Problems solved to optimality through Integer Programming modeling.•Preprocessing algorithms and IP-based primal heuristics described in detail.•Two large publicly available sets of challenging instances based on actual fo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 274; H. 3; S. 1090 - 1101
Hauptverfasser:	O. Zambon, Mauricio J., J. de Rezende, Pedro, C. de Souza, Cid
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.05.2019
Schlagworte:	Combinatorial optimization Computational geometry Geometric firefighter routing problem Integer programming Integer programming Computational geometry Combinatorial optimization Geometric firefighter routing problem
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!