scientific article; zbMATH DE number 4049150
From MaRDI portal
Publication:3786030
Recommendations
- A foundation of solution methods for constraint hierarchies
- An explicit algorithm for solving the optimize hierarchical problems
- scientific article; zbMATH DE number 4166931
- An efficient method for nonlinearly constrained networks
- A branch and cut algorithm for the hierarchical network design problem
- Network-based heuristics for constraint-satisfaction problems
- An efficient algorithm for a class of constraint satisfaction problems
- Solving hierarchies of finite-domain constraints
- Solving hierarchical constraints over finite domains with local search
Cited in
(10)- Network-based heuristics for constraint-satisfaction problems
- The string generating power of context-free hypergraph grammars
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The translation power of top-down tree-to-graph transducers
- Constraint relaxation may be perfect
- scientific article; zbMATH DE number 4166931 (Why is no real title available?)
- scientific article; zbMATH DE number 4166938 (Why is no real title available?)
- scientific article; zbMATH DE number 2084363 (Why is no real title available?)
- Dynamic algorithms for classes of constraint satisfaction problems
- A comparison of boundary graph grammars and context-free hypergraph grammars
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786030)
