Author of the publication

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.

, , , , and . ICTAC, volume 6916 of Lecture Notes in Computer Science, page 45-61. Springer, (2011)

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.

 

Other publications of authors with the same name

The statistical longest path problem and its application to delay analysis of logical circuits., , , and . Timing Issues in the Specification and Synthesis of Digital Systems, page 134-139. ACM, (2002)#P-hardness of Computing High Order Derivative and Its Logarithm.. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 97-A (6): 1382-1384 (2014)Approximating the longest path length of a stochastic DAG by a normal distribution in linear time., , and . J. Discrete Algorithms, 7 (4): 420-438 (2009)An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution., and . Algorithmica, 76 (4): 1245-1263 (2016)Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG., , , and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 98-107. Springer, (2009)Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand., , , , and . ICTAC, volume 6916 of Lecture Notes in Computer Science, page 45-61. Springer, (2011)An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths.. WALCOM, volume 10167 of Lecture Notes in Computer Science, page 421-432. Springer, (2017)The Volume of a Crosspolytope Truncated by a Halfspace., and . TAMC, volume 11436 of Lecture Notes in Computer Science, page 13-27. Springer, (2019)An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes., and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 13-24. Springer, (2017)The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length.. CoRR, (2019)