Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
From MaRDI portal
Recommendations
- Minimum Spanning Tree with Neighborhoods
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Solving the minimum label spanning tree problem by mathematical programming techniques
- An efficient mixed integer linear programming model for the minimum spanning tree problem
Cites work
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- An Approach to Location Models Involving Sets as Existing Facilities
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Applications of second-order cone programming
- Approximation algorithms for the Geometric Covering Salesman Problem
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Further results on the probabilistic traveling salesman problem
- Generalized Benders decomposition
- Integer Programming Formulation of Traveling Salesman Problems
- Largest and smallest convex hulls for imprecise points
- Locating facilities by minimax relative to closest points of demand areas
- Looking for edge-equitable spanning trees
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Minimum Spanning Tree with Neighborhoods
- Minimum-diameter covering problems
- On minimum-and maximum-weight minimum spanning trees with neighborhoods
- Ordered weighted average optimization in multiobjective spanning tree problem
- Partitioning procedures for solving mixed-variables programming problems
- Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Shortest Paths in Probabilistic Graphs
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- The travelling salesman problem with neighbourhoods: MINLP solution
- Touring a sequence of polygons
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(13)- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- Minimum Spanning Tree with Neighborhoods
- A multiple-drone arc routing and mothership coordination problem
- Ordered \(p\)-median problems with neighbourhoods
- An extended model of coordination of an all‐terrain vehicle and a multivisit drone
- Shortest Paths in Graphs of Convex Sets
- Coordinating drones with mothership vehicles: the mothership and drone routing problem with graphs
- On hub location problems in geographically flexible networks
- 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
- Facility location problems on graphs with non-convex neighborhoods
This page was built for publication: Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683122)
