Solving Constrained Combinatorial Optimisation Problems via MAP Inference without High-Order Penalties Jan 1, 2017· Zhen Zhang , Qinfeng Shi , Julian McAuley , Wei Wei , Yanning Zhang , Rui Yao , Anton Van Den Hengel · 0 min read Cite URL Type 1 Publication Proceedings of the AAAI Conference on Artificial Intelligence Last updated on Jan 1, 2017 ← Dynamic Programming Bipartite Belief Propagation For Hyper Graph Matching. Jan 1, 2017 Joint probabilistic matching using m-best solutions Jan 1, 2016 →