Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Karim Bouamrane

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Naima Belayachi

> Home > Persons > Karim Bouamrane

Publications

2022
[j24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jgim/YachbaBB22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgim/YachbaBB22
Khadidja Yachba, Naima Belayachi, Karim Bouamrane:
TS and ACO in Hybrid Approach for Product Distribution Problem. J. Glob. Inf. Manag. 30(8): 1-17 (2022)
2018
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/ijdsst/BelayachiAB18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijdsst/BelayachiAB18
Naima Belayachi, Fouzia Amrani, Karim Bouamrane:
A Decision-Making Tool for the Optimization of Empty Containers' Return in the Liner Shipping: Optimization by Using the Genetic Algorithm. Int. J. Decis. Support Syst. Technol. 10(3): 39-56 (2018)
2012
[c6]
- view
  - electronic edition @ ceur-ws.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/icwit/BouamraneBB12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icwit/BouamraneBB12
Karim Bouamrane, Hadj Ali Beghdadi, Naima Belayachi:
Towards a Numerical Model for the Representation of an Urban Transportation System. ICWIT 2012: 93-101

a service of

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.