Now showing items 1-10 of 10
Application of sequence-dependent traveling salesman problem in printed circuit board assembly
Optimization issues regarding the automated assembly of printed circuit boards attracted the interest of researchers for several decades. This is because even small gains in assembly time result in very important benefits ...
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ...
Fair-fixture: minimizing carry-over effects in football leagues
(American Institute of Mathematical Sciences, 2019-10)
We study a sports scheduling problem with the objective of minimizing carry-over effects in round robin tournaments. In the first part, focusing on tournaments that allow minimum number of breaks (at most one) for each ...
The one-warehouse multiretailer problem with an order-up-to level inventory policy
We consider a two-level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order-up-to level inventory policy over T periods and faces an external demand which is dynamic ...
A branch‐and‐cut approach for the least cost influence problem on social networks
This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ...
Least-cost influence maximization on social networks
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 ...
Exact and heuristic approaches to detect failures in failed k-out-of-n systems
This paper considers a k-out-of-n system that has just failed. There is an associated cost of testing each component. In addition, we have apriori information regarding the probabilities that a certain set of components ...
A branch-and-price-and-cut method for computing an optimal bramble
Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge ( i , j ) exists with node i belonging ...
An effective formulation of the multi-criteria test suite minimization problem
Test suite minimization problem has been mainly addressed by employing heuristic techniques or integer linear programming focusing on a specific criterion or bi-criteria. These approaches fall short to compute optimal ...
Share this page