Abstract
This paper is concerned with the design of efficient exact and heuristic algorithms for addressing a bilevel network pricing problem where demand is a nonlinear function of travel cost. The exact method is based on the piecewise linear approximation of the demand function, yielding mixed integer programming formulations, while heuristic procedures are developed within a bilevel trust region framework.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
