Login / Signup

Separating multi-oddity constrained shortest circuits over the polytope of stable multisets.

Eddie ChengSven de Vries
Published in: Oper. Res. Lett. (2004)
Keyphrases
  • high speed
  • lattice points
  • database
  • bayesian networks
  • shortest path
  • case study
  • dynamic programming