Soft Constraint Logic Programming and Generalized Shortest Path Problems

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP)...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 8; no. 1; pp. 25 - 41
Main Authors:	Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca
Format:	Journal Article
Language:	English
Published:	Boston Springer Nature B.V 01.01.2002
Subjects:	Algorithms Heuristic Logic programming Optimization Semantics Studies
ISSN:	1381-1231, 1572-9397
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!