The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
type: Item
instance of: scholarly article
title: The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
zbMATH Open document ID: 1317.90307
author: Marta S. R. Monteiro
author: Dalila B. M. M. Fontes
author: Fernando Fontes
published in: Optimization Letters
publication date: 2015-03-25T00:00:00Z
full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5262
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6419581
zbMATH Keywords: minimum spanning tree
zbMATH Keywords: network flows
zbMATH Keywords: hop-constraints
zbMATH Keywords: nonlinear costs
zbMATH Keywords: ant colony optimization
zbMATH Keywords: local search
describes a project that uses: OR-Library
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2053832189
cites work: New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
cites work: An improved ant colony optimization for vehicle routing problem
cites work: Assignment Problems
cites work: Q4415699
cites work: A deterministic annealing algorithm for the minimum concave cost network flow problem
cites work: Q5480099
cites work: Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
cites work: Heuristic solutions for general concave minimum cost network flow problems
cites work: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
cites work: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
cites work: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
cites work: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
cites work: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum
cites work: Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems
cites work: Ant colony optimization for the nonlinear resource allocation problem
DOI: 10.1007/S11590-014-0762-6
description: scientific article; zbMATH DE number 6419581