"Algorithms for irreducible infeasible subset detection in CSP - ..."

Jun Hu (2012)

> Home

Details and statistics

DOI: —

access: open

type: Book or Thesis

metadata version: 2020-07-21

- view
  - electronic edition @ archives-ouvertes.fr (open access)
- export record
  dblp key:
  - phd/hal/Hu12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Hu12
Jun Hu:
Algorithms for irreducible infeasible subset detection in CSP - Application to frequency planning and graph k-coloring. (Algorithmes pour la détection d'un sous ensemble irréalisable irréductible dans un CSP - Applications aux problèmes d'affectation des fréquences et problème de k-coloration). Université de technologie de Belfort-Montbéliard, France, 2012

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.