Author of the publication

Robust Optimization for the Hazardous Materials Transportation Network Design Problem.

, , and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 373-386. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Qingge, Letu
add a person with the name Qingge, Letu
 

Other publications of authors with the same name

Filling a Protein Scaffold with a Reference., , , and . ISBRA, volume 9683 of Lecture Notes in Computer Science, page 175-186. Springer, (2016)On the Minimum Copy Number Generation Problem in Cancer Genomics., , , and . BCB, page 260-269. ACM, (2018)A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications., , , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 26-38. Springer, (2018)Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory., , , and . WASA, volume 11604 of Lecture Notes in Computer Science, page 533-544. Springer, (2019)Robust Optimization for the Hazardous Materials Transportation Network Design Problem., , and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 373-386. Springer, (2013)On Approaching the One-Sided Exemplar Adjacency Number Problem., , , and . ISBRA, volume 10847 of Lecture Notes in Computer Science, page 275-286. Springer, (2018)A 2-approximation algorithm for the contig-based genomic scaffold filling problem., , , and . J. Bioinformatics and Computational Biology, 16 (6): 1850022 (2018)Robust optimization for the hazardous materials transportation network design problem., , , and . J. Comb. Optim., 30 (2): 320-334 (2015)Trajectory Comparison in a Vehicular Network II: Eliminating the Redundancy., , , , and . WASA, volume 11604 of Lecture Notes in Computer Science, page 260-271. Springer, (2019)