‎In this paper‎, ‎we are interested in studying subgroups of topologized fundamental groups and their influences on generalized covering maps‎. ‎More precisely‎, ‎we find some relationships between generalized covering subgroups and the other famous subgroups of the fundamental group equipped with the compact-open topology and the whisker topology‎. ‎Moreover‎, ‎we present some conditions unde...

This goal of this senior design project is to implement and analyze the effectiveness of different meta-heuristic algorithms on solving two constrained optimization problems: the Bin Packing Problem and the Generalized Assignment Problem. Specifically, we are most interested in applying a certain meta-heuristic technique, the Genetic Algorithm. Although genetic algorithms have been used to solv...

In the bin covering problem we are asked to pack a list X(n) = (x1, x2, . ,x,) of n items, each with size no larger than one, into the maximum number of bins such that the sum of the sizes of the items in each bin is at least one. In this article we analyze the asymptotic average-case behavior of the Iterated-Lowest-Fit-Decreasing (IUD) algorithm proposed by Assmann et al. Let OPT(X(n)) denote ...

In this paper, we consider a generalized the extensible bin packing problem with overload cost, first proposed by Denton et al. [1] in 2010, which total size of items packed into is allowed to exceed its capacity, and cost incurred each equal fixed plus objective minimize all bins. According characteristics problem, propose an improved ant colony optimization algorithm (IACO), enhances positive...

Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...

We present a new lemma stating that, given an arbitrary packing of a set of rectangles into a larger rectangle, a “structured” packing of nearly the same set of rectangles exists. This lemma has several implications on the approximability of 2-dimensional packing problems. In this paper, we use it to show the existence of a polynomial-time approximation scheme for 2-dimensional geometric knapsa...

Original Citation: Baldi M.M. Generalized Bin Packing Problems. In: 4OR. ISSN 1619-4500 (In Press) Availability: This version is available at : http://porto.polito.it/2523486/ since: December 2013 Publisher: Springer Published version: DOI:10.1007/s10288-013-0252-1 Terms of use: This article is made available under terms and conditions applicable to Open Access Policy Article ("Public All right...