Search
Now showing items 1-7 of 7
Application of sequence-dependent traveling salesman problem in printed circuit board assembly
(IEEE, 2013-06)
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
(Informs, 2011-08)
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 ...
The one-warehouse multiretailer problem with an order-up-to level inventory policy
(Wiley, 2010-10)
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 ...
Exact and heuristic approaches to detect failures in failed k-out-of-n systems
(Elsevier, 2019-12)
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
(Elsevier, 2015)
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 ...
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 ...
Share this page