A LAGRANGEAN RELAXATION-BASED SOLUTION APPROACH FOR MULTICOMMODITY NETWORK DESIGN PROBLEM WITH CAPACITY VIOLATIONS

A LAGRANGEAN RELAXATION-BASED SOLUTION APPROACH FOR MULTICOMMODITY NETWORK DESIGN PROBLEM WITH CAPACITY VIOLATIONS

In this study, we formulate and compare two different Lagrangean relaxation-based decompositions for multicommodity network problems with penalized constraints. These problems are different versions of capacitated multicommodity network problems where capacity constraints can be violated for additio...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Levent ERİŞKİN
Formato: article
Lenguaje:EN
Publicado: National Defense University Barbaros Naval Sciences and Engineering Institute Journal of Naval Science and Engineering 2021
Materias:
multicommodity network design problem
lagrangean relaxation
subgradient algorithm
decomposition
Naval Science
V
Acceso en línea:https://doaj.org/article/b3b68fa02cc84e4cb8c2fd0fe51722ca
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Ejemplares similares