A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
type: Item
instance of: scholarly article
title: A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
zbMATH Open document ID: 1276.90077
author: Dalila B. M. M. Fontes
author: José Fernando Gonçalves
published in: Optimization Letters
publication date: 2013-08-27T00:00:00Z
full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5267
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6201765
zbMATH Keywords: multi-population
zbMATH Keywords: genetic algorithms
zbMATH Keywords: local search
zbMATH Keywords: network flows
zbMATH Keywords: hop-constrained trees
zbMATH Keywords: general nonlinear costs
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W2054006251
cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
cites work: Large-Scale Network Topological Optimization
cites work: Introduction to algorithms
cites work: Q5294063
cites work: Heuristic solutions for general concave minimum cost network flow problems
cites work: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
cites work: A branch-and-bound algorithm for concave network flow problems
cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Network design techniques using adapted genetic algorithms
cites work: A genetic algorithm for the resource constrained multi-project scheduling problem
cites work: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
cites work: A hybrid genetic algorithm for the job shop scheduling problem
cites work: A parallel multi-population biased random-key genetic algorithm for a container loading problem
cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
cites work: Multicommodity flow models for spanning trees with hop constraints
cites work: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
cites work: Q4079017
cites work: A hop constrained min-sum arborescence with outage costs
cites work: Packet reordering in networks with heavy-tailed delays
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
cites work: Bilinear modeling solution approach for fixed charge network flow problems
DOI: 10.1007/S11590-012-0505-5
description: scientific article; zbMATH DE number 6201765