Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
type: Item
instance of: scholarly article
title: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
zbMATH Open document ID: 1375.90295
author: Víctor Blanco
author: Elena Fernández
author: Justo Puerto
published in: European Journal of Operational Research
publication date: 2017-12-06T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/114229
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6816187
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: minimum spanning trees
zbMATH Keywords: neighborhoods
zbMATH Keywords: mixed integer non linear programming
zbMATH Keywords: second order cone programming
describes a project that uses: Gurobi
MaRDI profile type: Publication
OpenAlex ID: W2606868416
cites work: Approximation algorithms for the Geometric Covering Salesman Problem
cites work: Minimum-diameter covering problems
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Further results on the probabilistic traveling salesman problem
cites work: Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
cites work: Locating facilities by minimax relative to closest points of demand areas
cites work: Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
cites work: On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods
cites work: Touring a sequence of polygons
cites work: Q5684698
cites work: Ordered weighted average optimization in multiobjective spanning tree problem
cites work: Benders decomposition without separability: a computational study for capacitated facility location problems
cites work: Shortest Paths in Probabilistic Graphs
cites work: The travelling salesman problem with neighbourhoods: MINLP solution
cites work: Generalized Benders decomposition
cites work: Biconvex sets and optimization with biconvex functions: a survey and extensions
cites work: Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
cites work: Looking for edge-equitable spanning trees
cites work: Applications of second-order cone programming
cites work: Largest and smallest convex hulls for imprecise points
cites work: Using separation algorithms to generate mixed integer model reformulations
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: An Approach to Location Models Involving Sets as Existing Facilities
cites work: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
cites work: Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
cites work: Minimum Spanning Tree with Neighborhoods
DOI: 10.1016/J.EJOR.2017.04.023
description: scientific article; zbMATH DE number 6816187