Pages that link to "Item:Q3003271"

The following pages link to Optimization Methods for the Partner Units Problem (Q3003271):

Displaying 16 items.

• Tractability frontiers of the partner units configuration problem (Q269477) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• On the complexity of the partner units decision problem (Q2407462) (← links)
• LoCo—A Logic for Configuration Problems (Q2946729) (← links)
• Interactive Debugging of Non-ground ASP Programs (Q3449213) (← links)
• Combining Heuristics for Configuration Problems Using Answer Set Programming (Q3449221) (← links)
• The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
• Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
• (Q5020542) (← links)
• Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems (Q5038464) (← links)
• Partial Compilation of ASP Programs (Q5108506) (← links)
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More (Q5140003) (← links)
• Managing caching strategies for stream reasoning with reinforcement learning (Q5140004) (← links)
• Debugging Non-ground ASP Programs: Technique and Graphical Tools (Q5197755) (← links)