Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Models for multi-path covering problems

From MaRDI portal
Publication:1270616
Jump to:navigation, search

DOI10.1023/A:1018923022243zbMath0910.90129MaRDI QIDQ1270616

Brian Boffey, Subhash C. Narula

Publication date: 8 December 1998

Published in: Annals of Operations Research (Search for Journal in Brave)


zbMATH Keywords

Lagrangian relaxationshortest pathroutingpath coveringmultiobjectivemulti-path models


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)


Related Items (4)

A Lagrangian relaxation approach for expansion of a highway network ⋮ Bayesian coverage optimization models ⋮ Facility location with tree topology and radial distance constraints ⋮ Strategic route extension in transit networks






This page was built for publication: Models for multi-path covering problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1270616&oldid=13371139"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 09:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki