IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v188y2008i2p390-405.html
   My bibliography  Save this article

Hypernetworks in a directed hypergraph

Author

Listed:
  • Volpentesta, Antonio P.

Abstract

No abstract is available for this item.

Suggested Citation

  • Volpentesta, Antonio P., 2008. "Hypernetworks in a directed hypergraph," European Journal of Operational Research, Elsevier, vol. 188(2), pages 390-405, July.
    • Handle: RePEc:eee:ejores:v:188:y:2008:i:2:p:390-405
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00417-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Mikhailov, L., 2002. "Fuzzy analytical approach to partnership selection in formation of virtual enterprises," Omega, Elsevier, vol. 30(5), pages 393-401, October.
    2. Ip, W. H. & Yung, K. L. & Wang, Dingwei, 2004. "A branch and bound algorithm for sub-contractor selection in agile manufacturing environment," International Journal of Production Economics, Elsevier, vol. 87(2), pages 195-205, January.
    3. Maloni, Michael J. & Benton, W.C., 1997. "Supply chain partnerships: Opportunities for operations research," European Journal of Operational Research, Elsevier, vol. 101(3), pages 419-429, September.
    4. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    5. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qian Wang & Zeng-Tai Gong, 2020. "Structural centrality in fuzzy social networks based on fuzzy hypergraph theory," Computational and Mathematical Organization Theory, Springer, vol. 26(2), pages 236-254, June.
    2. Ma, Xiujuan & Ma, Fuxiang & Yin, Jun & Zhao, Haixing, 2018. "Cascading failures of k uniform hyper-network based on the hyper adjacent matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 281-289.
    3. Xiao Liao & Guangyu Ye & Juan Yu & Yunjiang Xi, 2021. "Identifying lead users in online user innovation communities based on supernetwork," Annals of Operations Research, Springer, vol. 300(2), pages 515-543, May.
    4. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    5. Feng Hu & Lin Ma & Xiu-Xiu Zhan & Yinzuo Zhou & Chuang Liu & Haixing Zhao & Zi-Ke Zhang, 2021. "The aging effect in evolving scientific citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 4297-4309, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ivanov, Dmitry & Sokolov, Boris & Kaeschel, Joachim, 2010. "A multi-structural framework for adaptive supply chain planning and operations control with structure dynamics considerations," European Journal of Operational Research, Elsevier, vol. 200(2), pages 409-420, January.
    2. Simona, Dinu & Raluca, Pacuraru, 2011. "Intelligent modeling method based on genetic algorithm for partner selection in virtual organizations," Business and Economic Horizons (BEH), Prague Development Center (PRADEC), vol. 5(2), pages 1-12, April.
    3. Wu, Chong & Barnes, David, 2010. "Formulating partner selection criteria for agile supply chains: A Dempster-Shafer belief acceptability optimisation approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 284-293, June.
    4. Dinu Simona & Pacuraru Raluca, 2011. "Intelligent modeling method based on genetic algorithm for partner selection in virtual organizations," Business and Economic Horizons (BEH), Prague Development Center, vol. 5(2), pages 23-34, April.
    5. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    6. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    7. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    8. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    9. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    10. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    11. Ding Luo & Oded Cats & Hans Lint, 2020. "Can passenger flow distribution be estimated solely based on network properties in public transport systems?," Transportation, Springer, vol. 47(6), pages 2757-2776, December.
    12. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    13. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    14. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    15. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    16. Wang, Ying-Ming & Elhag, Taha M.S., 2007. "A goal programming method for obtaining interval weights from an interval comparison matrix," European Journal of Operational Research, Elsevier, vol. 177(1), pages 458-471, February.
    17. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    18. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    19. M. Vanhoucke, 2006. "A scatter search procedure for maximizing the net present value of a project under renewable resource constraints," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/417, Ghent University, Faculty of Economics and Business Administration.
    20. Ip, W. H. & Yung, K. L. & Wang, Dingwei, 2004. "A branch and bound algorithm for sub-contractor selection in agile manufacturing environment," International Journal of Production Economics, Elsevier, vol. 87(2), pages 195-205, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:eee:ejores:v:188:y:2008:i:2:p:390-405. See general information about how to correct material in RePEc.

    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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.