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

Primal-Dual-Based Algorithms for a Directed Network Design Problem

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

DOI10.1287/IJOC.1040.0066zbMath1239.90100OpenAlexW2157542236MaRDI QIDQ2890464

Éva Tardos, Vardges Melkonian

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1040.0066


zbMATH Keywords

integer programminganalysis of algorithmsnetworks-graphs


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10)


Related Items (2)

New primal-dual algorithms for Steiner tree problems ⋮ Approximation algorithms for constructing some required structures in digraphs







This page was built for publication: Primal-Dual-Based Algorithms for a Directed Network Design Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2890464&oldid=15849491"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki