Login / Signup

A fast algorithm for identifying minimum size instances of the equivalence classes of the Pallet Loading Problem.

Yiping LuJianzhong Cha
Published in: Eur. J. Oper. Res. (2014)
Keyphrases
  • equivalence classes
  • equivalence class
  • directed acyclic graph
  • bayesian network structures
  • randomly generated
  • spanning tree
  • markov equivalence classes
  • knowledge discovery
  • directed graph
  • memory requirements