Traffic scheduling via Benders decomposition

From MaRDI portal

Revision as of 22:19, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3934125

Jump to:navigation, search

DOI10.1007/BFb0120940zbMath0477.90029OpenAlexW81490126MaRDI QIDQ3934125

Robert R. Jun. Love

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120940

zbMATH Keywords

routing mathematical formulation solution technique network applications traffic scheduling Benders decomposition algorithm transportation fleet management

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Related Items (3)

Pickup and Delivery of Partial Loads with “Soft” Time Windows ⋮ A practical anti-degeneracy row selection technique in network linear programming ⋮ A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern

This page was built for publication: Traffic scheduling via Benders decomposition

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3934125&oldid=17615403"