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

Graph collapsing in shortest path auction algorithms

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

DOI10.1023/A:1011246118315zbMath0974.90020MaRDI QIDQ5942938

Paola Festa, Giancarlo Raiconi, Raffaele Cerulli

Publication date: 16 December 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

shortest pathauction techniquenetwork optimization


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Shortest path reoptimization vs resolution from scratch: a computational comparison ⋮ On Some Special Network Flow Problems: The Shortest Path Tour Problems


Uses Software

  • NETGEN



This page was built for publication: Graph collapsing in shortest path auction algorithms

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