Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Christophe Duhamel

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 Thiago F. Noronha

> Home > Persons > Christophe Duhamel

Publications

2023
[j33]
- view
  authority control:
- export record
  dblp key:
  - journals/itor/CarvalhoNDVS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/itor/CarvalhoNDVS23
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira, Vinícius Fernandes dos Santos:
A fix-and-optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty. Int. Trans. Oper. Res. 30(2): 1120-1143 (2023)
2022
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/rairo/CarvalhoND22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rairo/CarvalhoND22
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty. RAIRO Oper. Res. 56(6): 4281-4301 (2022)
2019
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1908-05082
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1908-05082
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel:
Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data. CoRR abs/1908.05082 (2019)
2018
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/CarvalhoNDV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/CarvalhoNDV18
Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira:
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs. Electron. Notes Discret. Math. 66: 39-46 (2018)

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.