The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment
From MaRDI portal
Publication:2899066
DOI10.1287/ijoc.1090.0354zbMath1243.90256OpenAlexW2116839129MaRDI QIDQ2899066
Jeffrey L. Kennington, Charles D. Nicholson
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3d6d2f398c729422f81542a67b52a934ebf41010
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (2)
A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem ⋮ Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
This page was built for publication: The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment