Abstract

Consider: (1) a finite set of transport infrastructural investment projects (TIIP) previously analysed by the decision maker(s) in the framework of some multicriterion analysis process in order to reveal a preference (i.e. precedence)—relation pair set (PRS) and; (2) the ranking problem of this TIIP subject to the PRS constraints and a quasi‐equal financial expenses rhythm‐constraint. We outline an algorithmic aid of this ranking problem exploiting deliberately the non‐mutual congruity between an incomplete PRS and resulting hierarchical structures.

Full Text
Paper version not known

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 call

Disclaimer: 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.