Results 21 to 30 of about 79 (70)

Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design

open access: yesEURO 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   +1 more source

Compact ILP formulations for the routing and wavelength assignment problem in the design of optical transport networks with regenerators

open access: yesEURO 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   +1 more source

Lagrangean bounds for the optimum communication spanning tree problem

open access: yes, 2010
Network design, Lagrangean relaxation, Heuristics, 90B10, 90B18, 90C10,
Alfredo Marín   +5 more
core   +1 more source

Road network emergency accessibility planning after a major earthquake

open access: yesEURO Journal on Computational Optimization, 2016
In the aftermath of disasters such as major earthquakes, several roads may be blocked by rubble and the population tends to search refugee in certain gathering points of the city.
CelsoSatoshi Sakuraba   +5 more
doaj   +1 more source

A Parametric Network Approach for Concepts Hierarchy Generation in Text Corpus

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The article presents a preflow approach for the parametric maximum flow problem, derived from the rules of constructing concepts hierarchy in text corpus.
Sângeorzan L. S.   +2 more
doaj   +1 more source

A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations

open access: yes
Minimum cost spanning tree situations, Cost allocation, 90B10,
Barış Çiftçi, Stef Tijs
core   +1 more source

Thep-facility ordered median problem on networks

open access: yes
Location, networks, finite dominating sets, 90B10, 90B80, 90B85,
J. Puerto   +3 more
core   +1 more source

The least square values and the shapley value for cooperative TU games

open access: yes
Cooperative TU games, Shapley value, least square values, average per capita formula, potential basis, inverse problem, 90B05, 90B10,
Irinel Dragan
core   +1 more source

Generalized Lax-Hopf formulas for Cournot Maps and Hamilton-Jacobi-McKendrik equations

open access: yes, 2014
Mathematics Subject Classification: 34A60, 90B10, 90B20, 90B99, 93C10, 93C30, 93C99A generalization of Lax-Hopf formula in the case when the Lagrangian depends not only on the velocity, but also on time, state and velocity has been provided by Luxi Chen.
Aubin, Jean-Pierre, Luxi, Chen
core   +1 more source

Invariant states for fluid models of EDF networks: nonlinear lifting map

open access: yes, 2010
We study fluid models of an open, subcritical multiclass queueing network with the earliest-deadline-first EDF service discipline and we provide a characterization of the corresponding invariant manifold.
Kruk, Łukasz
core  

Home - About - Disclaimer - Privacy