default search action

combined dblp search
author search
venue search
publication search

ask others

Frederik Jan Jüngen

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1999
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/aai/BrazierJJT99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aai/BrazierJJT99
Frances M. T. Brazier, Catholijn M. Jonker, Frederik Jan Jüngen, Jan Treur:
Distributed Scheduling to Support a Call Center: A Cooperative Multiagent Approach. Appl. Artif. Intell. 13(1-2): 65-90 (1999)
1998
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jetai/JungenK98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jetai/JungenK98
Frederik Jan Jüngen, Wojtek Kowalczyk:
Approximate algorithms for generalized maximum utility problems. J. Exp. Theor. Artif. Intell. 10(1): 49-62 (1998)
[c2]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/paam/BrazierJJT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/paam/BrazierJJT98
Frances M. T. Brazier, Catholijn M. Jonker, Frederik Jan Jüngen, Jan Treur:
Distributed Scheduling to Support a Call Centre: a Co-operative Multi-Agent Approach. PAAM 1998: 555-576
1996
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/cp/JungenK96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/JungenK96
Frederik Jan Jüngen, Wojtek Kowalczyk:
Appriximate Algorithms for Maximum Utility Problems. CP 1996: 547-548

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.