IDEAS home Printed from
   My bibliography  Save this article

Revenue maximisation in networks with capacity constraints


  • J.Q. Hu
  • Pirooz Vakili
  • Chenming Zhao


In this article, we study the revenue maximisation problem for a given network subject to various capacity constraints. Though the problem in general can be formulated as an integer linear programming (ILP) problem, it is computationally infeasible to solve the ILP problem for large networks. We propose several approximate methods. Our methods are mainly based on two steps. First, we order the traffic demands in certain sequence based on their priority indices, and we then route the demands one by one based on their order sequence subject to capacity constraints. Numerical results are provided to validate our methods.

Suggested Citation

  • J.Q. Hu & Pirooz Vakili & Chenming Zhao, 2009. "Revenue maximisation in networks with capacity constraints," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 3(4), pages 371-392.
  • Handle: RePEc:ids:ijrevm:v:3:y:2009:i:4:p:371-392

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijrevm:v:3:y:2009:i:4:p:371-392. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Carmel O'Grady). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.