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

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 262; no. 3; pp. 863 - 878
Main Authors:	Blanco, Víctor, Fernández, Elena, Puerto, Justo
Format:	Journal Article Publication
Language:	English
Published:	Elsevier B.V 01.11.2017 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!