Hybrid tractability of valued constraint problems (Q646503): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic structure of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4253835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiring-based constraint satisfaction and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of conservative valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets of Maximum Weight in Apple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global warming: Flow-based soft global constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing AllDifferent: The SomeDifferent Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-based arc consistency for global cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank

Latest revision as of 15:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Hybrid tractability of valued constraint problems
scientific article

    Statements

    Hybrid tractability of valued constraint problems (English)
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    constraint optimisation
    0 references
    computational complexity
    0 references
    tractability
    0 references
    soft constraints
    0 references
    valued constraint satisfaction problems
    0 references
    graphical models
    0 references
    forbidden substructures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers