Soft constraint logic programming and generalized shortest path problems

DOI10.1023/A:1013609600697MaRDI QIDQ5960030zbMATH OpenFDO

Authors Stefano Bistarelli, Ugo Montanari, Francesca Rossi

Publication date 11 April 2002

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1013609600697

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1045433
• Constraint-based local search for constrained optimum paths problems
• Soft concurrent constraint programming
• scientific article; zbMATH DE number 1926617
• Industrial linear optimization problems solved by constraint logic programming

Cited in

(10)

• scientific article; zbMATH DE number 5141522 (Why is no real title available?)
• Finding reliable solutions: event-driven probabilistic constraint programming
• A Soft Approach to Multi-objective Optimization
• Semiring-Based Soft Constraints
• The optimal dispatch of Traffic and Patrol Police Service Platforms
• Quantitative \(\mu\)-calculus and CTL defined over constraint semirings
• C-semiring Frameworks for Minimum Spanning Tree Problems
• Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming
• Unicast and multicast QoS routing with soft-constraint logic programming
• Weighted monadic Datalog

This page was built for publication: Soft constraint logic programming and generalized shortest path problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960030)