Browsing by Subject "Combinatorial optimization"
Now showing items 1-5 of 5
-
Constrained min-cut replication for k-way hypergraph partitioning
(Informs, 2014)Replication is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ... -
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 ... -
A new application of the traveling salesman problem: The Turkish cashier problem
(Ministry Communications & High Technologies Republic Azerbaijan, 2022)We define the problem of finding a route for the cashier that minimizes the cost of transportation as the Turkish Cashier Problem (TCP). It is a special case of the well-known traveling salesman problem. To solve the TCP, ... -
Software diversity for improved network security: optimal distribution of software-based shared vulnerabilities
(Informs, 2017-12)Firms, and other agencies, tend to adopt widely used software to gain economic benefits of scale, which can lead to a software monoculture. This can, in turn, involve the risk of correlated computer systems failure as all ... -
The traveling salesman problem with pickups, deliveries, and handling costs
(Informs, 2010-08)This paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The ...
Share this page