All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On the efficient design of a network under multiple criteria

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F25%3A103148" target="_blank" >RIV/60460709:41110/25:103148 - isvavai.cz</a>

  • Result on the web

    <a href="https://mme2025.utb.cz/committees/" target="_blank" >https://mme2025.utb.cz/committees/</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    On the efficient design of a network under multiple criteria

  • Original language description

    The problem of searching for a maximum flow between a source and a terminal in a network with limited edge capacities is a classic problem of graph theory. We assume that the edge capacities are not explicitly given but subject to a predefined lower and upper bound. We aim to design a network that would enable maximum flow between two vertices, while additional criteria may be considered, such as the cost of edge capacity building or flow risk mitigation. We propose a methodology for constructing the optimal edge capacities with respect to a given budget. The optimal edge capacities represent an efficient design in a multiobjective sense. Our approach is inspired by the DeNovo optimisation framework with specific adjustments. We demonstrate our methodology using an artificial example. A comparison with traditional multiobjective approaches is shown, and it turns out that none of them can be considered superior to the others, as is usual in multiobjective optimisation. However, the average performance of our approach appeared to outperform the other methods, which implies that it does matter which method is applied for a particular case.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 43rd Conference on Mathematical Methods in Economics

  • ISBN

    978-80-11-07486-9

  • ISSN

    2788-3965

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    43-48

  • Publisher name

    Tomas Bata university in Zlin

  • Place of publication

    Zlín

  • Event location

    Zlín

  • Event date

    Jan 1, 2025

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article