Author of the publication

Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues.

, , and . Manag. Sci., 47 (2): 264-279 (2001)

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

On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem., , , , , and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 170-184. Springer, (2001)Approximation algorithms for stochastic orienteering., , , and . SODA, page 1522-1538. SIAM, (2012)Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models., , , , and . SODA, page 2411-2428. SIAM, (2023)LAST but not Least: Online Spanners for Buy-at-Bulk., , , and . SODA, page 589-599. SIAM, (2017)Redeeming Nested Dissection: Parallelism Implies Fill., , , and . PPSC, (1999)Approximating k-cuts via network strength., and . SODA, page 621-622. ACM/SIAM, (2002)When cycles collapse: A general approximation technique for constrained two-connectivity problems., and . IPCO, page 39-55. CIACO, (1993)Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract). FOCS, page 202-213. IEEE Computer Society, (1994)Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems., , , and . STOC, page 100-105. ACM, (1998)Pricing Tree Access Networks with Connected Backbones., , , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 498-509. Springer, (2007)