default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVan-Dat Cung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Asiye Kurt, Mario Cortes Cornax, Agnès Front, Van-Dat Cung, Fabien Mangione:
CircuSChain: a Method to Continuously Improve Circularity in Supply Chains. INFORSID 2023: 49-64- 2022
- [j10]Lizhi Wang, Vassilissa Lehoux
, Marie-Laure Espinouse, Van-Dat Cung:
Itineraries evaluated and ranked using fuzzy logic. J. Intell. Transp. Syst. 26(4): 383-399 (2022) - 2021
- [c13]Camille Gras, Van-Dat Cung, Nathalie Herr, Alantha Newman:
A Hierarchical Network Approach for Long-Haul Parcel Transportation. APMS (5) 2021: 168-178 - [c12]Asiye Kurt, Mario Cortes Cornax, Van-Dat Cung, Agnès Front, Fabien Mangione:
A Classification Tool for Circular Supply Chain Indicators. APMS (5) 2021: 644-653
2010 – 2019
- 2019
- [j9]Nicolas Brulard, Van-Dat Cung, Nicolas Catusse, Cyril Dutrieux:
An integrated sizing and planning problem in designing diverse vegetable farming systems. Int. J. Prod. Res. 57(4): 1018-1036 (2019) - [j8]Muhammad Khoirul Khakim Habibi, Olga Battaïa, Van-Dat Cung, Alexandre Dolgui, Manoj Kumar Tiwari:
Sample average approximation for multi-vehicle collection-disassembly problem under uncertainty. Int. J. Prod. Res. 57(8): 2409-2428 (2019) - [c11]Asiye Kurt, Van-Dat Cung, Fabien Mangione, Mario Cortes Cornax, Agnès Front:
An Extended Circular Supply Chain Model Including Repurposing Activities. ICCAD 2019: 1-6 - 2017
- [j7]Muhammad Khoirul Khakim Habibi, Olga Battaïa, Van-Dat Cung, Alexandre Dolgui:
An efficient two-phase iterative heuristic for Collection-Disassembly problem. Comput. Ind. Eng. 110: 505-514 (2017) - [c10]Widad Naji, Van-Dat Cung, Marie-Laure Espinouse:
Robust preemptive scheduling on unrelated parallel machines under uncertain processing times. CoDIT 2017: 986-991 - 2015
- [c9]Widad Naji, Marie-Laure Espinouse, Van-Dat Cung:
Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach. MCO (2) 2015: 343-355 - [c8]Duy Long Ha, Hervé Guillou, Nicolas Martin, Van-Dat Cung, Mireille Jacomino:
Optimal scheduling for coordination renewable energy and electric vehicles consumption. SmartGridComm 2015: 319-324 - 2014
- [c7]Muhammad Khoirul Khakim Habibi, Olga Battaïa, Van-Dat Cung, Alexandre Dolgui:
Integrated Procurement-Disassembly Problem. APMS (2) 2014: 482-490 - 2013
- [j6]Maxime Ogier, Van-Dat Cung, Julien Boissière:
Service network design in short and local fresh food supply chain. RAIRO Oper. Res. 47(4): 445-464 (2013) - 2011
- [j5]Susann Schrenk, Gerd Finke, Van-Dat Cung:
Two classical transportation problems revisited: Pure constant fixed charges and the paradox. Math. Comput. Model. 54(9-10): 2306-2315 (2011) - [j4]Alexandra Pomares-Quimbaya, Claudia Roncancio, Van-Dat Cung, María-Del-Pilar Villamil:
Improving Source Selection in Large Scale Mediation Systems through Combinatorial Optimization Techniques. Trans. Large Scale Data Knowl. Centered Syst. 3: 138-166 (2011) - 2010
- [j3]Susann Schrenk, Teodor Gabriel Crainic, Van-Dat Cung, Gerd Finke:
Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules. Stud. Inform. Univ. 8(2): 35-60 (2010) - [c6]Alexandra Pomares-Quimbaya, Claudia Roncancio, Van-Dat Cung, José Abásolo, María-Del-Pilar Villamil:
Source Selection in Large Scale Data Contexts: An Optimization Approach. DEXA (1) 2010: 46-61
2000 – 2009
- 2009
- [j2]Christian Artigues, Van-Dat Cung, Gerd Finke, Bernard Penz:
Articles ROADEF 2007. RAIRO Oper. Res. 43(4): 373-374 (2009) - 2008
- [j1]Christine Solnon, Van-Dat Cung, Alain Nguyen, Christian Artigues:
The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem. Eur. J. Oper. Res. 191(3): 912-927 (2008) - 2006
- [c5]A. Djerrah, Bertrand Le Cun, Van-Dat Cung, Catherine Roucairol:
Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods. HPDC 2006: 369-370
1990 – 1999
- 1996
- [c4]Mohamed Benaïchouche, Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol:
Building a parallel branch and bound library. Solving Combinatorial Optimization Problems in Parallel 1996: 201-231 - 1994
- [c3]Van-Dat Cung, Bertrand Le Cun:
An Efficient Implementation of Parallel A*. Canada-France Conference on Parallel and Distributed Computing 1994: 153-168 - [c2]Van-Dat Cung, Salah Dowaji, Bertrand Le Cun, Thierry Mautor, Catherine Roucairol:
Concurrent data structures and load balancing strategies for parallel branch-and-bound/A* algorithms. Parallel Algorithms 1994: 141-162 - 1993
- [c1]Van-Dat Cung:
Parallelizations of Game-Tree Search. PARCO 1993: 505-508
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
