Partially ordered constraint optimization problems

DOI10.1007/3-540-45578-7_64MaRDI QIDQ4475693zbMATH OpenFDO

Authors Marco Gavanelli

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390763.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Outer branching: how to optimize under partial orders?
• scientific article; zbMATH DE number 741507
• Lexicographically-ordered constraint satisfaction problems
• New applications of partial orders
• A constructive solution to the ranking problem in partial order optimality theory

Cited in

(9)

• A constructive solution to the ranking problem in partial order optimality theory
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• On Solving Optimization Problems with Ordered Average Criteria and Constraints
• Outer branching: how to optimize under partial orders?
• Mathematical programming models for optimizing partial-order plan flexibility
• Solved forms for path ordering constraints
• Solving simplification ordering constraints
• Problems of order optimization
• Optimal ordered problem solver

This page was built for publication: Partially ordered constraint optimization problems

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