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...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 274; číslo 3; s. 1090 - 1101
Hlavní autori:	O. Zambon, Mauricio J., J. de Rezende, Pedro, C. de Souza, Cid
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.05.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!