Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723

This is a corrigendum to our research paper titled “Bilevel time minimizing transportation problem” published in 2008. We deeply regret a minor error in the formulation of an intermediate problem solved as part of the algorithm. The intermediate problem, (TP)tT, used to iteratively generate the pros...

Full description

Saved in:
Bibliographic Details
Published in:Discrete optimization 2024-11, Vol.54, p.100863, Article 100863
Main Authors: Sonia, Khandelwal, Ankit
Format: Article
Language:English
Subjects:
Bilevel TMTP
Corrigendum
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This is a corrigendum to our research paper titled “Bilevel time minimizing transportation problem” published in 2008. We deeply regret a minor error in the formulation of an intermediate problem solved as part of the algorithm. The intermediate problem, (TP)tT, used to iteratively generate the prospective solution pairs, was initially modeled as a linear programming problem. But the correct formulation of its objective function now involves a binary function, thus making it an NP-hard problem. The algorithm is no longer polynomially bound as it involves solving a finite number of mixed 0-1 programming problems. The manuscript’s original contribution stands correct and there is no change to the structure or the accuracy of the algorithm. The changes required to the original paper, due to this error, are presented in this corrigendum.
ISSN:1572-5286
DOI:10.1016/j.disopt.2024.100863