Buscar
Mostrando ítems 1-10 de 97
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows
(John Wiley & Sons Inc, 2020-07)
In this paper we implement a branch-price and cut algorithm for a time dependent vehicle routing problem with time windows in which the goal is to minimize the total route duration. The travel time between two customers ...
Towards the automatization of the Foucault knife-edge quantitative test
(SPIE, 2017-09)
Given the increasing necessity of simple, economical and reliable methods and instruments for performing quality tests of optical surfaces such as mirrors and lenses, in the recent years we resumed the study of the long ...
Algoritmos experimentais para o problema biobjetivo da árvore geradora quadrática em adjacência de arestas
(Universidade Federal do Rio Grande do NorteBrasilUFRNPROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO, 2016-02-03)
The Quadratic Minimum Spanning Tree (QMST) problem is a generalization of the Minimum
Spanning Tree problem in which, beyond linear costs associated to each edge,
quadratic costs associated to each pair of edges must be ...
Iterative edge length interval constraining in triangular meshes based on local parametrization
(Universidade Federal de Juiz de Fora (UFJF)BrasilICE – Instituto de Ciências ExatasPrograma de Pós-graduação em Ciência da ComputaçãoUFJF, 2017)
Pricing with markups in industries with increasing marginal costs
(Springer, 2014)
We study a game that models a market in which heterogeneous producers
of perfect substitutes make pricing decisions in a first stage, followed by consumers
that select a producer that sells at lowest price. As opposed ...
Variants of the mixed postman problem solvable using linear programmingVariantes del problema del cartero mixto que se pueden resolver usando programación lineal
(2012-07-01)
Given a connected mixed graph with costs on its edges and arcs, the mixed postman problem consists of finding a minimum cost closed tour of the mixed graph traversing all of its edges and arcs. It is well-known that this ...
Variants of the mixed postman problem solvable using linear programmingVariantes del problema del cartero mixto que se pueden resolver usando programación lineal
(2012-07-01)
Given a connected mixed graph with costs on its edges and arcs, the mixed postman problem consists of finding a minimum cost closed tour of the mixed graph traversing all of its edges and arcs. It is well-known that this ...
Diagonal edge preconditioners in p-version and spectral element methods
(Siam PublicationsPhiladelphia, 1997)
Variants of the mixed postman problem solvable using linear programmingVariantes del problema del cartero mixto que se pueden resolver usando programación lineal
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2012)
Hibridização de algoritmos exatos e meta-heurísticas para o problema da árvore geradora quadrática em adjacência de arestas biobjetivo
(Universidade Federal do Rio Grande do NorteBrasilUFRNCiência da Computação, 2017-06)
The Minimum Spanning Tree Problem (MST) consists of, given a finite non-directed graph G = (V, E) with |V| = n and |E| = m, weighted by edges, find an acyclic and connected spanning subgraph so that the sum of the weights ...