Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem

DOI10.1155/2019/9640708MaRDI QIDQ2299016zbMATH OpenOpenAlexFDO

Authors Yiyong Pan

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/9640708

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites work

• Lagrangian relaxation for the multiple constrained robust shortest path problem

Cited in

(1)

• Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem

This page was built for publication: Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299016)