Results 61 to 70 of about 339 (75)
EURO Journal on Computational Optimization, 2015 Many real-world optimization models comprise nonconvex and nonsmooth functions leading to very hard classes of optimization models. In this article, a new interior-point method for the special, but practically relevant class of optimization problems with
Martin Schmidt
doaj
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
EURO Journal on Computational Optimization, 2014 We present a branch-and-price-and-cut algorithm for solving large-scale instances of the multicommodity capacitated fixed-charge network design problem.
Bernard Gendron, Mathieu Larose
doaj
EURO Journal on Computational Optimization, 2016 This paper addresses two variants of the routing and wavelength assignment problem arising in the context of optical transport networks. In both variants, we address the case where the physical coverage of the fiber network is such that regenerators, to ...
Amaro de Sousa +2 more
doaj
Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
, 2017 Study the general single-source shortest path problem. Firstly, define a path function on a set of some path with same source on a graph, and develop a kind of general single-source shortest path problem (GSSSP) on the defined path function.
Cheng, Cong-Dian
core
The four-in-a-tree problem in triangle-free graphs [PDF]
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question
Christophe Picouleau +2 more
core
Detecting induced subgraphs [PDF]
An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one).
Benjamin Lévêque +3 more
core
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
A genetic algorithm for the arrival probability in the stochastic networks. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]
Math ProgramÇela E +4 more
europepmc +1 more source