### Table 1 Cost, revenue and demand data for the example lot-sizing problem Period t

in W

2002

"... In PAGE 6: ... We present an example with four periods to demonstrate the impact of including the option of lost sales in the objective function. Table1 gives the price, cost and demand data of our example. In this example, the demand and the unit-selling price for the good in question follow a seasonal pattern.... ..."

### TABLE II RESULTS OF TABU SEARCH AND REROUTING OPTIMIZATION HEURISTICS FOR SOLVING THE REVENUE MAXIMIZATION PROBLEM IN THE ITALIAN NETWORK.

2003

Cited by 11

### Table 4 Revenue and Contribution Enhancement by Contribution-Maximization Linear Programming Solution

"... In PAGE 7: ... The optimal allocation solution, accomplished revenue, and contribution amount were tracked for each of the two methods at each demand-intensity level (Tables 2 and 3). The revenue and contribution enhancement by the contribution-maximization LP was then calculated (see Table4 ). In terms of revenue, there was no difference between the two approaches atany levelof demand intensity.... ..."

### Table 5: Approximate dynamic programming results for the cases of Table 4. ~ J denotes the revenue generated by the approximate policy. For Cases 4 and 5 it is computationally intractable to obtain the optimal static and dynamic policies.

2000

"... In PAGE 24: ... The computation of optimal static and dynamic prices becomes computationally prohibitive as the state space grows, thus, we will resort to the approximation methods outlined in Sections 8 and 9. In Table5 we report approximate dynamic programming results for a number of problems including some large-scale ones. We have used the approach outlined in item 2 of Section 9.... In PAGE 25: ...19 35000 3500 2.06 Table 4: The input parameters for the results of Table5 . We considered two-class systems with demand functions of the form i(ui) = 0;i ?ui 1;i and r1 = 4, r2 = 1, 1 = 1, 2 = 2.... In PAGE 26: ...Figure 4: Approximate dynamic prices for Case 3 of Table5 . Figures (a) and (b) depict prices for classes one and two, respectively.... ..."

Cited by 81

### Table 5: Approximate dynamic programming results for the cases of Table 4. ~ J denotes the revenue generated by the approximate policy. For Cases 4 and 5 it is computationally intractable to obtain the optimal static and dynamic policies.

2000

"... In PAGE 24: ... The computation of optimal static and dynamic prices becomes computationally prohibitive as the state space grows, thus, we will resort to the approximation methods outlined in Sections 8 and 9. In Table5 we report approximate dynamic programming results for a number of problems including some large-scale ones. We have used the approach outlined in item 2 of Section 9.... In PAGE 25: ...19 35000 3500 2.06 Table 4: The input parameters for the results of Table5 . We considered two-class systems with demand functions of the form i(ui) = 0;i ?ui 1;i and r1 = 4, r2 = 1, 1 = 1, 2 = 2.... In PAGE 26: ...Figure 4: Approximate dynamic prices for Case 3 of Table5 . Figures (a) and (b) depict prices for classes one and two, respectively.... ..."

Cited by 81

### Table 2: Prices, demand satisfactions, and revenues for separated and one-price networks

1998

"... In PAGE 14: ... The right-hand sides of these equations are multiplied by 1/64 to obtain the corresponding equations for V2. Table2 shows approximate solution values in terms of price x, demand satisfaction S and revenue R. The one-price network price in each row is midway between the prices for A and B in the separated network, P2 induces slightly higher prices than P1 and P3, and prices drop dramatically with high... ..."

Cited by 25

### Table 2: Prices, demand satisfactions, and revenues for separated and one-price networks

1998

"... In PAGE 8: ... The right-hand sides of these equations are multiplied by 1/64 to obtain the corresponding equations for V2. Table2 shows approximate solution values in terms of price x, demand satisfaction S and revenue R. The one-price network price in each row is midway between the prices for A and B in the separated network, P2 induces slightly higher prices than P1 and P3, and prices drop dramatically with high volume.... ..."

Cited by 25

### Table 2: Prices, demand satisfactions, and revenues for separated and one-price networks

in Odlyzko, Dynamic behavior of differential pricing and Quality of Service options for the Internet

1998

"... In PAGE 14: ... The right-hand sides of these equations are multiplied by 1/64 to obtain the corresponding equations for a2 a33 . Table2 shows approximate solution values in terms of price a11 , demand satisfaction a153 and revenue a154 . The one-price network price in each row is midway between the prices for a0 and a1 in the separated network, a8 a33 induces slightly higher prices than a8 a29 and a8a81a134 , and prices drop dramatically with high... ..."

Cited by 25

### Table 2: Prices, demand satisfactions, and revenues for separated and one-price networks

in Odlyzko, Dynamic behavior of differential pricing and Quality of Service options for the Internet

1998

"... In PAGE 8: ... The right-hand sides of these equations are multiplied by 1/64 to obtain the corresponding equations for a2 a31 . Table2 shows approximate solution values in terms of price a10 , demand satisfaction a139 and revenue a140 . The one-price network price in each row is midway between the prices for a0 and a1 in the separated network, a7 a31 induces slightly higher prices than a7 a27 and a7a80a118 , and prices drop dramatically with high volume.... ..."

Cited by 25