Minimum Spanning Trees with neighborhoods: Mathematical programming formulations and solution methods

•Minimum Spanning Trees with second order cone-representable neighborhoods and lengths are studied.•Two Mixed Integer Nonlinear models are presented.•A decomposition approach is proposed which is embedded within an branch-and-cut scheme.•An alternate convex search heuristic is developed, by using a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 262; H. 3; S. 863 - 878
Hauptverfasser:	Blanco, Víctor, Fernández, Elena, Puerto, Justo
Format:	Journal Article Verlag
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2017 Elsevier
Schlagworte:	05 Combinatorics 05C Graph theory 90 Operations research, mathematical programming 90C Mathematical programming Classificació AMS Combinatorial Optimization Grafs, Teoria de Graph theory Investigació operativa Matemàtica discreta Matemàtiques i estadística Minimum Spanning Trees Mixed Integer Non Linear Programming Neighborhoods Programació (Matemàtica) Programming (Mathematics) Second order cone programming Teoria de grafs Àrees temàtiques de la UPC Combinatorial Optimization Minimum Spanning Trees Neighborhoods Mixed Integer Non Linear Programming Second order cone programming
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!