The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
From MaRDI portal
Publication:2018861
DOI10.1007/s11590-014-0762-6zbMath1317.90307MaRDI QIDQ2018861
Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes
Publication date: 25 March 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5262
local search; network flows; minimum spanning tree; ant colony optimization; hop-constraints; nonlinear costs
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
- A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems
- A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum
- An improved ant colony optimization for vehicle routing problem
- Ant colony optimization for the nonlinear resource allocation problem
- Assignment Problems
- Heuristic solutions for general concave minimum cost network flow problems
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks
