Results 51 to 60 of about 10,477 (184)
Maximal strongly connected cliques in directed graphs: Algorithms and bounds
, 2021 International audienceFinding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associated with dense subgraphs, and many community ...
Conte, Alessio +3 more
core +2 more sources
Clearing in financial networks with constrained equal awards
InformatikaObjectives. Financial networks with a rule of constrained equal awards for the distribution of the agent’s estate between its creditors are considered. The aim of the study is to develop an algorithm for constructing greatest clearing matrices for such ...
Ya. M. Shafransky
doaj +1 more source
Algorithms for network piecewise-linear programs
, 1994 In this paper a subarea of Piecewise-Linear Programming named network Piecewise-Linear Programming (NPLP) is discussed. Initially the problem formulation, main efinitins and related Concepts are presented.
Machado, A, Marins, F A S, Perin, C
core
Algorithms for the rainbow vertex coloring problem on graph classes
, 2021 Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices.
Lima, Paloma T. +5 more
core +1 more source
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
, 1995 We present new strongly polynomial algorithms for special cases of convex separable quadratic minimization over submodular constraints. The main results are: an O(NM log(N2/M)) algorithm for the problem Network defined on a network on M arcs and N nodes;
Hong, Sung-Pil, Hochbaum, Dorit S.
core +1 more source
Local quadratic convergence of polynomial-time interior-point methods for conic optimization problems [PDF]
In this paper, we establish a local quadratic convergence of polynomial-time interior-point methods for general conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier ...
NESTEROV, Yu., TUNCEL, Levent
core
A Strongly Polynomial Algorithm for Arctic Auctions
Our main contribution is a strongly polynomial algorithm for computing an equilibrium for the Arctic Auction, which is the quasi-linear extension of the linear Fisher market model. We build directly on Orlin's strongly polynomial algorithm for the linear Fisher market (Orlin, 2010).
Garg, Jugal +2 more
openaire +2 more sources
Deterministic Method for Input Sequence Modification in NEH-Based Algorithms
IEEE AccessScheduling of production jobs falls into the area of planning, which, according to Henri Fayol’s conception, is one of the basic functions of management.
Radoslaw Puka +4 more
doaj +1 more source
Maximum constraint satisfaction on diamonds [PDF]
In this paper we study the complexity of the (weighted) maximum constr aint satisfaction problem (Max CSP) over an arbitrary finite domain. In this pro blem, one is given a collection of weighted constraints on overlapping sets of v ariables, and the ...
Krokhin, Andrei, Larose, Benoit
core
Strongly polynomial algorithms for solution of some classes of mathematical programming problems
, 1992 Systems of linear inequalities, systems of linear equations, packaging problems, minimax problems are considered in the paper aiming at the separation of classes of mathematical programming problems, permitting strongly polynomial solution algorithms. As
Gorokh Oleg Vladimirovich
core