Auction algorithms for shortest hyperpath problems

DOI10.1137/S1052623498343477MaRDI QIDQ2706320zbMATH OpenFDO

Authors Renato De Leone, D. Pretolani

Publication date 19 March 2001

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623498343477

zbMATH Keywords

shortest pathsdirected hypergraphsauction algorithmshyperpaths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Hypergraphs (05C65)

Recommendations

• Polynomial auction algorithms for shortest paths
• An Auction Algorithm for Shortest Paths
• Parallel shortest path auction algorithms
• Auction algorithms for network flow problems: A tutorial introduction
• Graph collapsing in shortest path auction algorithms

Cited in

(5)

• Shortest path auction algorithm without contractions using virtual source concept
• Auction/Belief Propagation Algorithms for Constrained Assignment Problem
• The auction algorithm for the transportation problem
• An Auction Algorithm for Shortest Paths
• Graph collapsing in shortest path auction algorithms

This page was built for publication: Auction algorithms for shortest hyperpath problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706320)