COST FUNCTION

Year: 1981

• Shapiro, L., R. Haralick. 1981. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 3: 504-519. [More] [Bibtex] [RIS] [MODS]

Year: 1976

• M. Minoux. 1976. Structures algébriques généralisées des problèmes de cheminement dans les graphes. Recherche opérationnelle 10(6): 33-62. [More] [Bibtex] [RIS] [MODS]
• C. H. Papadimitriou. 1976. The NP-completeness of the bandwidth minimization problem. Computing 16: 263-270. [More] [Bibtex] [RIS] [MODS]
• Rosenfeld, A., Hummel, R., S. Zucker. 1976. Scene Labeling by Relaxation Operations. IEEE Trans. on Systems, Man, and Cybernetics 6(6): 173-184. [More] [Bibtex] [RIS] [MODS]
• M. I. Schlesinger. 1976. Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions). Kibernetika 4: 113-130. [More] [Bibtex] [RIS] [MODS]

Year: 1972

• Bertelé, Umberto, Francesco Brioshi. 1972. Nonserial Dynamic Programming. Academic Press [More] [Bibtex] [RIS] [MODS]

No year

• M. Lemaître. LVCSP: a Library for Valued CSP. Available at sf ftp://ftp.cert.fr/pub/lemaitre/LVCSP. [More] [Bibtex] [RIS] [MODS]
• Terrioux, C., P. Jegou. Bounded backtracking for the valued constraint satisfaction problems. In Proc. of the Ninth International Conference on Principles and Practice of Constraint Programming (CP-2003). [More] [Bibtex] [RIS] [MODS]