Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
From MaRDI portal
Publication:1683122
DOI10.1016/j.ejor.2017.04.023zbMath1375.90295OpenAlexW2606868416MaRDI QIDQ1683122
Elena Fernández, Víctor Blanco, Justo Puerto
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/114229
combinatorial optimizationminimum spanning treessecond order cone programmingneighborhoodsmixed integer non linear programming
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Quadratic programming (90C20)
Related Items (11)
Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs ⋮ A multiple-drone arc routing and mothership coordination problem ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ On hub location problems in geographically flexible networks ⋮ An extended model of coordination of an all‐terrain vehicle and a multivisit drone ⋮ Shortest Paths in Graphs of Convex Sets ⋮ Unnamed Item ⋮ Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ Minimum cost \(b\)-matching problems with neighborhoods
Uses Software
Cites Work
- Unnamed Item
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Looking for edge-equitable spanning trees
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Largest and smallest convex hulls for imprecise points
- Applications of second-order cone programming
- Partitioning procedures for solving mixed-variables programming problems
- Using separation algorithms to generate mixed integer model reformulations
- Approximation algorithms for the Geometric Covering Salesman Problem
- Ordered weighted average optimization in multiobjective spanning tree problem
- Further results on the probabilistic traveling salesman problem
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Generalized Benders decomposition
- On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods
- Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
- Integer Programming Formulation of Traveling Salesman Problems
- Touring a sequence of polygons
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Minimum-diameter covering problems
- The travelling salesman problem with neighbourhoods: MINLP solution
- Minimum Spanning Tree with Neighborhoods
- Shortest Paths in Probabilistic Graphs
- An Approach to Location Models Involving Sets as Existing Facilities
- Locating facilities by minimax relative to closest points of demand areas
This page was built for publication: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
