Towards High Order Constraint Representations for the Frequency Assignment Problem

Towards High Order Constraint Representations for the Frequency Assignment Problem

Bibliografski detalji
Glavni autori:	N.W.Dunkin, J.E.Bater, P.G.Jeavons, D.A.Cohen
Format:	Report
Izdano:	Royal Holloway‚ University of London 1998

Slični predmeti

Why higher order constraints are necessary to model frequency assignment problems
od: P.G.Jeavons, i dr.
Izdano: (1998)

Expressiveness of Binary Constraints for the Frequency Assignment Problem
od: N.W.Dunkin, i dr.
Izdano: (1997)

Are there optimal reuse distance constraints for FAPs with random Tx placements?
od: J.E.Bater, i dr.
Izdano: (1998)

Decomposing Constraint Satisfaction Problems Using Database Techniques
od: M.Gyssens, i dr.
Izdano: (1994)

Constraints‚ Consistency and Closure
od: P.G.Jeavons, i dr.
Izdano: (1998)

Tractable Disjunctive Constraints
od: D.A.Cohen, i dr.
Izdano: (1997)

Closure Properties of Constraints
od: P.G.Jeavons, i dr.
Izdano: (1997)

Derivation of Constraints and Database Relations
od: D.A.Cohen, i dr.
Izdano: (1996)

A Unifying Framework for Tractable Constraints
od: P.G.Jeavons, i dr.
Izdano: (1995)

How to determine the expressive power of constraints
od: P.G.Jeavons, i dr.
Izdano: (1999)

Constraints and Universal Algebra
od: P.G.Jeavons, i dr.
Izdano: (1998)

Characterising Tractable Constraints
od: M.C.Cooper, i dr.
Izdano: (1994)

A Substitution Operation for Constraints
od: P.G.Jeavons, i dr.
Izdano: (1995)

Tractable Constraints on Ordered Domains
od: P.G.Jeavons, i dr.
Izdano: (1995)

Constructing constraints
od: P.G.Jeavons
Izdano: (1998)

A Survey of Tractable Constraint Satisfaction Problems
od: J.K.Pearson, i dr.
Izdano: (1997)

A Test for Tractability
od: P.G.Jeavons, i dr.
Izdano: (1996)

A Structural Decomposition for Hypergraphs
od: P.G.Jeavons, i dr.
Izdano: (1994)

Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques
od: P.G.Jeavons
Izdano: (1994)

Comments on frequency assignment problems /
od: 448308 Struzak, R. G.

On The Algebraic Structure Of Combinatorial Problems
od: P.G.Jeavons
Izdano: (1998)

Order statistics and the linear assignment problem
od: Frenk, Johannes Bartholomeus Gerardus., i dr.
Izdano: (2009)

Order assignment heuristic in a build to order environment
od: Cohen, Aviv, 1971-
Izdano: (2014)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2006)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2005)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2006)

Symmetry definitions for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2005)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2008)

A complete characterization of complexity for Boolean constraint optimization problems
od: Cohen, D, i dr.
Izdano: (2004)

A complete characterization of complexity for boolean constraint optimization problems
od: Cohen, D, i dr.
Izdano: (2004)

A unified theory of structural tractability for constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2008)

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
od: Barak, Boaz, i dr.
Izdano: (2016)

Binarisation for valued constraint satisfaction problems
od: Cohen, D, i dr.
Izdano: (2017)

Binary constraint satisfaction problems defined by excluded topological minors
od: Cohen, D, i dr.
Izdano: (2018)

The complexity of constraint languages
od: Cohen, D, i dr.
Izdano: (2006)

Assignment problems /
od: 345537 Burkard, Rainer, i dr.
Izdano: (2009)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i dr.
Izdano: (2000)

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i dr.
Izdano: (2004)

Constraint satisfaction problems and finite algebras
od: Bulatov, A, i dr.
Izdano: (2000)

Constraint satisfaction problems on intervals and lengths
od: Krokhin, A, i dr.
Izdano: (2004)