Results 31 to 40 of about 307 (69)
Pebbling in Semi-2-Trees [PDF]
, 2017 Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\sf NP}$-complete, even for diameter two graphs, and ...
Alcón, Liliana +2 more
core +3 more sources
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
A branch-and-cut algorithm for the target visitation problem
EURO Journal on Computational Optimization, 2019 In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base ...
Achim Hildenbrandt
doaj +1 more source
On some interconnections between combinatorial optimization and extremal graph theory [PDF]
, 2004 The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set.
Cvetković Dragoš M. +2 more
core +1 more source
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
EURO Journal on Computational Optimization, 2019 We consider nonlinear and nonsmooth mixing aspects in gas transport optimization problems. As mixed-integer reformulations of pooling-type mixing models already render small-size instances computationally intractable, we investigate the applicability of ...
FalkM. Hante, Martin Schmidt
doaj +1 more source
Sum-of-squares clustering on networks [PDF]
, 2011 Finding p prototypes by minimizing the sum of the squared distances from a set of points to its closest prototype is a well-studied problem in clustering, data analysis and continuous location. In this note, this very same problem is addressed assuming,
Carrizosa Priego, Emilio José +2 more
core +2 more sources
Variantes del problema del cartero mixto que se pueden resolver usando programación lineal
Revista de Matemática: Teoría y Aplicaciones, 2012 Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro.
Francisco Javier Zaragoza Martínez +1 more
doaj +1 more source
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 +1 more source
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 +1 more source
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 +1 more source