In this paper, we present a novel approach that makes use of topic models based on Latent Dirichlet allocation(LDA) for generating single document summaries. Our approach is distinguished from other LDA based approaches in that we identify the summary topics which best describe a given document and only extract sentences from those paragraphs within the document which are highly correlated give...

Multi-robot task allocation research has focused on sequential single-item auctions and various extensions as quick methods for allocating tasks to robots with small overall team costs. In this paper we outline the benefits of grouping tasks with positive synergies together and auctioning clusters of tasks rather than individual tasks. We show that with task-clustering the winner determination ...

This paper proposes a new lower bounding procedure for the Uncapacitated Single Allocation p-Hub Median Problem based on Lagrangean relaxation. For solving the resulting Lagrangean subproblem, the given problem structure is exploited: it can be decomposed into smaller subproblems that can be solved efficiently by combinatorial algorithms. Our computational experiments for some benchmark instanc...

conclusions single dose therapy of mtx has sufficient power and efficacy in the treatment of ectopic pregnancy, however in patients with higher serum level of β-hcg, the successful treatment increases by using double dose method. using double dose also could decrease the necessity of operation, re-administration of mtx, and duration of hospitalization. results results showed that the rate of su...

Given a metric graph G = (V,E,w) and a positive integer k, the Single Allocation k-Hub Center problem is to find a spanning subgraph H of G such that (i) C ⊂ V is a clique of size k in H; (ii) V \ C forms an independent set in H; (iii) each v ∈ V \C is adjacent to exactly one vertex in C; and (iv) the diameter D(H) is minimized. The vertices selected in C are called hubs and the rest of vertice...

Allocating buffers in manufacturing systems is one of easiest ways to improve the throughput of the system, as changes can be implemented quickly and the initial cost of the change is low. Yet, while an increase in the buffer size usually increases the throughput, it often also increases the work in progress and the makespan, therefore increasing the inventory and the time to the customer. Subs...

This paper discusses the fixed-hub single allocation problem. In the model hubs are fixed and fully connected; and each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. This paper presents linear programming-based algorithms that deliver both high quality solutions and a theoretical worst case bound....

The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...

Allocating buffers in manufacturing systems is one of easiest ways to improve the throughput of the system, as changes can be implemented quickly and the initial cost of the change is low. Yet, while an increase in the buffer size usually increases the throughput, it often also increases the work in progress and the makespan, therefore increasing the inventory and the time to the customer. Subs...

In this paper, we present a single-shift workforce planning tool: the Head Count Allocation Solver (HCA) for a high volume manufacturing facility with several machine groups at each operation. Each machine group at a given operation requires a number of workers with specified skill levels and qualifications, and each qualified worker has a preference for operations and machine groups based on h...