Search Results - Kolen, Antoon W.J.

  • Showing 1 - 11 results of 11
Refine Results
  1. 1
    Interval scheduling: A survey

    Interval scheduling: A survey by Kolen, Antoon W.J., Lenstra, Jan Karel, Papadimitriou, Christos H., Spieksma, Frits C.R.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Solving partial constraint satisfaction problems with tree decomposition

    Solving partial constraint satisfaction problems with tree decomposition by Koster, Arie M. C. A., van Hoesel, Stan P. M., Kolen, Antoon W. J.

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    The partial constraint satisfaction problem: Facets and lifting theorems

    The partial constraint satisfaction problem: Facets and lifting theorems by Koster, Arie M.C.A., Hoesel, Stan P.M.van, Kolen, Antoon W.J.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    A dynamic programming algorithm for the local access telecommunication network expansion problem

    A dynamic programming algorithm for the local access telecommunication network expansion problem by Flippo, Olaf E., Kolen, Antoon W.J., Koster, Arie M.C.A., van de Leensel, Robert L.M.J.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    On the computational complexity of (maximum) class scheduling

    On the computational complexity of (maximum) class scheduling by Kolen, Antoon W.J., Kroon, Leo G.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  6. 6
    An analysis of shift class design problems

    An analysis of shift class design problems by Kolen, Antoon W.J., Kroon, Leo G.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    On the computational complexity of (maximum) shift class scheduling

    On the computational complexity of (maximum) shift class scheduling by Kolen, Antoon W.J., Kroon, Leo G.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    Solving Frequency Assignment Problems via Tree-Decomposition

    Solving Frequency Assignment Problems via Tree-Decomposition by KOSTER, A, VANHOESEL, S, KOLEN, A

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  9. 9
    Solving Frequency Assignment Problems via Tree-Decomposition1

    Solving Frequency Assignment Problems via Tree-Decomposition1 by Koster, Arie M.C.A., van Hoesel, Stan P.M., Kolen, Antoon W.J.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    License class design: complexity and algorithms

    License class design: complexity and algorithms by Kolen, Antoon W.J., Kroon, Leo G.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 11
    Vehicle Routing with Time Windows

    Vehicle Routing with Time Windows by Kolen, A. W. J, Rinnooy Kan, A. H. G, Trienekens, H. W. J. M

    Published in Operations research
    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:

Search Tools: