Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
type: Item
instance of: scholarly article
title: Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
zbMATH Open document ID: 1487.90574
author: Jake Weiner
author: Andreas T. Ernst
author: Xiaodong Li
author: Kalyanmoy Deb
author: Yu-An Sun
published in: European Journal of Operational Research
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7355896
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: large scale optimization
zbMATH Keywords: metaheuristics
describes a project that uses: pyrgg
describes a project that uses: COMET
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.01.009
OpenAlex ID: W3121006322
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: Finding edge-disjoint paths in networks: an ant colony optimization algorithm
cites work: Escaping a grid by edge-disjoint paths
cites work: A note on two problems in connexion with graphs
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Reducibility among Combinatorial Problems
cites work: Approximating disjoint-path problems using packing integer programs
cites work: Solving the edge‐disjoint paths problem using a two‐stage method
cites work: The cavity method at zero temperature
cites work: LS(graph): a constraint-based local search for constraint optimization on trees and paths
cites work: Efficient routing in all-optical networks
cites work: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
cites work: New bundle methods for solving Lagrangian relaxation dual problems
DOI: 10.1016/J.EJOR.2021.01.009
description: scientific article; zbMATH DE number 7355896