An efficient decoding algorithm is a crucial element of any statistical machine translation system. Some researchers have noted certain similarities between SMT decoding and the f...
Mikhail Zaslavskiy, Marc Dymetman, Nicola Cancedda
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...