Revenue maximisation in networks with capacity constraints
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 3 (2009)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=99|
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: (Darren Simpson)
If references are entirely missing, you can add them using this form.