Search
Now showing items 71-80 of 198
Cyclic delivery schedules for an inventory routing problem
(Informs, 2015-11)
We consider an inventory routing problem where a common vendor is responsible for replenishing the inventories of several customers over a perpetual time horizon. The objective of the vendor is to minimize the total cost ...
Cost allocation mechanisms in a peer‐to‐peer network
(Wiley, 2019-01)
This study analyzes a cooperative game between a service provider and a set of users. We consider a P2P network where the service provider broadcasts the content across the network and the users collaborate to seed the ...
Calibrating artificial neural networks by global optimization
(Elsevier, 2012-01)
Artificial neural networks (ANNs) are used extensively to model unknown or unspecified functional relationships between the input and output of a “black box” system. In order to apply the generic ANN concept to actual ...
Collaborative prepositioning network design for regional disaster response
(Wiley, 2019-10)
We present a collaborative prepositioning strategy to strengthen the disaster preparedness of the Caribbean countries, which are frequently hit by hurricanes. Since different subsets of countries are affected in each ...
A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
(Springer Nature, 2020-03)
In this paper, we introduce a multi-cover routing problem (MCRP), which is motivated by post-disaster rapid needs assessment operations performed to evaluate the impact of the disaster on different affected community groups. ...
The Steiner tree problem with delays: a compact formulation and reduction procedures
(Elsevier, 2014-02-19)
This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size ...
Least-cost influence maximization on social networks
(Informs, 2020-03)
Viral-marketing strategies are of significant interest in the online economy. Roughly, in these problems, one seeks to identify which individuals to strategically target in a social network so that a given proportion of ...
Algorithmic expedients for the prize collecting Steiner tree problem
(Elsevier, 2010)
This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ...
Exact approaches for integrated aircraft fleeting and routing at TunisAir
(Science+Business Media, 2011-06)
We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost ...
Exact methods for the robotic cell problem
(Springer Science+Business Media, 2011-06)
This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. ...
Share this page