scientific article; zbMATH DE number 1239857

MaRDI QIDQ4225614zbMATH OpenFDO

Authors

Publication date 13 January 1999

zbMATH Keywords

\(k\)-shortest path methodsgeneralized assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Finding the K shortest hyperpaths
• A network flow algorithm for solving generalized assignment problem
• Solving k-shortest and constrained shortest path problems efficiently

This page was built for publication:

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