Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Hoang Trung La
@article{DBLP:journals/scheduling/BriandLE07, author = {Cyril Briand and Hoang Trung La and Jacques Erschler}, title = {A robust approach for the single machine scheduling problem}, journal = {J. Sched.}, volume = {10}, number = {3}, pages = {209--221}, year = {2007}, url = {https://doi.org/10.1007/s10951-007-0010-3}, doi = {10.1007/S10951-007-0010-3}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/scheduling/BriandLE07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/BriandLE06, author = {Cyril Briand and Hoang Trung La and Jacques Erschler}, title = {A new sufficient condition of optimality for the two-machine flowshop problem}, journal = {Eur. J. Oper. Res.}, volume = {169}, number = {3}, pages = {712--722}, year = {2006}, url = {https://doi.org/10.1016/j.ejor.2004.10.027}, doi = {10.1016/J.EJOR.2004.10.027}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/BriandLE06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rivf/BriandL03, author = {Cyril Briand and Hoang Trung La}, title = {Une Proc{\'{e}}dure Par S{\'{e}}paration Et {\'{E}}valuation Progressive Pour l'Ordonnancement Robuste De Probl{\`{e}}mes {\`{A}} Une Machine}, booktitle = {Actes de la Premi{\`{e}}re Conf{\'{e}}rence Internationale RIVF'03 Rencontres en Informatique Vietnam-France, RIVF'03, Hanoi, Vietnam, 10-13 F{\'{e}}vrier, 2003}, pages = {11--16}, publisher = {Editions Suger, Paris}, year = {2003}, url = {http://www.e-ifi.org/rivf2003/proceedings/p11-16.pdf}, timestamp = {Mon, 06 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/rivf/BriandL03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.