Results 1 to 10 of about 37 (35)
Some Results on Path-Factor Critical Avoidable Graphs
Discussiones Mathematicae Graph Theory, 2023 A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Networks of causal relationships in the U.S. stock market
Dependence Modeling, 2022 We consider a network-based framework for studying causal relationships in financial markets and demonstrate this approach by applying it to the entire U.S. stock market.
Shirokikh Oleg +6 more
doaj +1 more source
Decomposing tournaments into paths
Proceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020 Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo +3 more
wiley +1 more source
EURO Journal on Computational Optimization, 2018 In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND).
Mervat Chouman +2 more
doaj +1 more source
Evacuation modeling: a case study on linear and nonlinear network flow models
EURO Journal on Computational Optimization, 2016 We present a nonlinear traffic flow network model that is coupled to gaseous hazard information for evacuation planning. This model is evaluated numerically against a linear network flow model for different objective functions that are relevant for ...
Simone Göttlich +3 more
doaj +1 more source
A hybrid approach to the solution of a pricing model with continuous demand segmentation
EURO Journal on Computational Optimization, 2013 Price optimization fits naturally the framework of bilevel programming, where a leader integrates within its decision process the reaction of rational customers.
Patrice Marcotte +2 more
doaj +1 more source
Sink location to find optimal shelters in evacuation planning
EURO Journal on Computational Optimization, 2016 The sink location problem is a combination of network flow and location problems: from a given set of nodes in a flow network a minimum cost subset W has to be selected such that given supplies can be transported to the nodes in W.
P. Heßler, H.W. Hamacher
doaj +1 more source
Evaluating the quality of image matrices in blockmodeling
EURO Journal on Computational Optimization, 2015 One approach for analyzing large networks is to partition its nodes into classes where the nodes in a class have similar characteristics with respect to their connections in the network. A class is represented as a blockmodel (or image matrix).
Stefan Wiesberg, Gerhard Reinelt
doaj +1 more source
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks [PDF]
Computer Science Journal of Moldova, 2005 The game-theoretic formulation of the multiobjective multicommodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
Algorithms for minimum flows [PDF]
Computer Science Journal of Moldova, 2001 We present a generic preflow algorithm and several implementations of it, that solve the minimum flow problem in O(n2m) time.
Eleonor Ciurea, Laura Ciupal
doaj