竞彩猫|官网

<address id="bjvfb"><listing id="bjvfb"><span id="bjvfb"></span></listing></address>

        <output id="bjvfb"></output><address id="bjvfb"></address>

        <form id="bjvfb"><th id="bjvfb"><th id="bjvfb"></th></th></form>

          <sub id="bjvfb"><listing id="bjvfb"><listing id="bjvfb"></listing></listing></sub>
            <noframes id="bjvfb">

            An Enhanced Concave Program Relaxation for Choice Network Revenue Management

            Joern Meissner, Arne K Strauss, Kalyan Talluri

            Abstract The network choice revenue management problem models customers as choosing from an offer set, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear program called the CDLP which has an exponential number of columns. However, under the choice-set paradigm when the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has been proposed but finding an entering column has been shown to be NP-hard. In this paper, starting with a concave program formulation called SDCP that is based on segment-level consideration sets, we add a class of constraints called product constraints (σPC), that project onto subsets of intersections. In addition we propose a natural direct tightening of the SDCP called ESDCPK, and compare the performance of both methods on the benchmark data sets in the literature. In our computational testing on the benchmark data sets in the literature, 2PC achieves the CDLP value at a fraction of the CPU time taken by column generation. For a large network our 2PC procedure runs under 70 seconds to come within 0.02% of the CDLP value, while column generation takes around 1 hour; for an even larger network with 68 legs, column generation does not converge even in 10 hours for most of the scenarios while 2PC runs under 9 minutes. Thus we believe our approach is very promising for quickly approximating CDLP when segment consideration sets overlap and the consideration sets themselves are relatively small.
            Keywords

            Bid Prices, Yield Management, Heuristics, Discrete-Choice, Network Revenue Management

            Status Forthcoming in Production and Operations Management (POM).
            Download www.neticom.cn/download/RM-Meissner-Strauss-Talluri.pdf
            (241 kb)
            Reference BibTeX, Plain Text
            Back to Publications


            <address id="bjvfb"><listing id="bjvfb"><span id="bjvfb"></span></listing></address>

                  <output id="bjvfb"></output><address id="bjvfb"></address>

                  <form id="bjvfb"><th id="bjvfb"><th id="bjvfb"></th></th></form>

                    <sub id="bjvfb"><listing id="bjvfb"><listing id="bjvfb"></listing></listing></sub>
                      <noframes id="bjvfb">

                      Real estate

                      Mobile Games

                      news

                      Second-hand housing

                      Finance

                      Go abroad

                      explore

                      Variety show

                      mailbox