Persistency Model and Its Applications in Choice Modeling

References

• Adams W. P., Lassiter J. B., Sherali H. D. Persistency in 0-1 polynomial programming. Math. Oper. Res. (1998) 23(2):359–389Link, Google Scholar
• Ben-Akiva M., Bierlaire M., Hall R. Discrete choice methods and their applications to short-term travel decisions. Handbook of Transportation Science (1999) 23(Kluwer Academic, Boston) 5–34International Series in Operations Research and Management ScienceCrossref, Google Scholar
• Ben-Akiva M., Lerman S.Discrete Choice Analysis: Theory and Application to Travel Demand (1985) (MIT Press, Cambridge, MA) Google Scholar
• Bertsimas D., Natarajan K., Teo C. P. Probabilistic combinatorial optimization: Moments, semidefinite programming and asymptotic bounds. SIAM J. Optim. (2004) 15(1):185–209Crossref, Google Scholar
• Bertsimas D., Natarajan K., Teo C. P. Persistence in discrete optimization under data uncertainty. Math. Prog. (2006) 108(2):251–274Crossref, Google Scholar
• Bierlaire M., Chevroulet T., Sevestre A. BIOGEME: A free package for the estimation of discrete choice models. Proc. 3rd Swiss Transportation Res. Conf. (2003) Ascona, SwitzerlandGoogle Scholar
• Bierlaire M., Axhausen K., Abay G. The acceptance of modal innovation: The case of Swissmetro. Proc. 1st Swiss Transportation Res. Conf. (2001) Ascona, SwitzerlandGoogle Scholar
• Lovász L. Energy of convex sets, shortest paths, and resistance. J. Comb. Theory, Ser. A (2001) 94(2):363–382Crossref, Google Scholar
• Lyons R., Pemantle R., Peres Y. Resistance bounds for first-passage percolation and maximum flow. J. Comb. Theory, Ser. A (1999) 86(1):158–168Crossref, Google Scholar
• McFadden D., Zarembka P. Conditional logit analysis of qualitative choice behavior. Frontiers in Econmetrics (1974) (Academic Press, New York) 105–142Google Scholar
• Meilijson I., Nadas A. Convex majorization with an application to the length of critical path. J. Appl. Probab. (1979) 16:671–677Crossref, Google Scholar
• Nadas A. Probabilistic PERT. IBM J. Res. Dev. (1979) 23:339–347Crossref, Google Scholar
• Sherali H. D., Adams W. P.A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999) (Kluwer Academic Publishers, Dordrecht/Boston/London) Crossref, Google Scholar
• Spellucci P.DONLP2 Users Guide (1993) . Department of Mathematics, Technical University at Darmstadt, Darmstadt, GermanyGoogle Scholar
• Steele J. M. Probability Theory and Combinatorial Optimization. CBMS-NSF Reg. Conf. Ser. in Appl. Math. (1997) 69(SIAM, Philadephia) Crossref, Google Scholar
• Steinberg E., Parks M. S. A preference order dynamic program for a knapsack problem with stochastic rewards. J. Oper. Res. Soc. (1979) 30(2):141–147Crossref, Google Scholar
• Weiss G. Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability. Oper. Res. (1986) 34(4):595–605Link, Google Scholar
• Vanderbei R. LOQO user's manual—Version 4.05. (2006) . Technical report, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, http://www.princeton.edu/∼rvdb/tex/loqo/loqo405.pdfGoogle Scholar