Search
Now showing items 71-80 of 133
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. ...
Decision rule bounds for two-stage stochastic bilevel programs
(Society for Industrial and Applied Mathematics Publications, 2018)
We study two-stage stochastic bilevel programs where the leader chooses a binary here-and-now decision and the follower responds with a continuous wait-and-see decision. Using modern decision rule approximations, we construct ...
An exact algorithm for the Steiner tree problem with delays
(Elsevier, 2010-08-01)
The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...
Cyclic ordering policies from capacitated suppliers under limited cycle time
(Elsevier, 2019-02)
In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective ...
Solving a large-scale integrated fleet assignment and crew pairing problem
(Springer International Publishing, 2017)
Airline schedule planning problems are typically decomposed into smaller problems, which are solved in a sequential manner, due to the complexity of the overall problems. This results in suboptimal solutions as well as ...
Share this page