In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem,...

We address a version of the Half-Product Problem and its restricted variant with a linear knapsack constraint. For these minimization problems of Boolean programming, we focus on the development of fully polynomial-time approximation schemes with running times that depend quadratically on the...

The problem of fair zone design for local public transportation networks is considered. A network model which was introduced by Hamacher and Schöbel in [2] is investigated. We present theoretical results for special transportation networks and heuristic algorithms for the general problem....

Thek-partitioning problem is defined as follows: Given a set of items {I 1 ,I 2 ,...,I n } where itemIj is of weightwj ≥ 0, find a partitionS 1 ,S 2 ,...,S m of this set with ¦S i ¦ =k such that the maximum weight of all subsetsS i is minimal,k-partitioning is strongly related to the...

The problem of fair zone design for local public transportation networks is considered. A network model which was introduced by Hamacher and Schöbel in [2] is investigated. We present theoretical results for special transportation networks and heuristic algorithms for the general problem....

Thek-partitioning problem is defined as follows: Given a set of items {I <Subscript>1</Subscript>,I <Subscript>2</Subscript>,...,I <Subscript>n</Subscript>} where itemIj is of weightwj ≥ 0, find a partitionS <Subscript>1</Subscript>,S <Subscript>2</Subscript>,...,S <Subscript> m </Subscript> of this set with ¦S <Subscript> i </Subscript>¦ =k such that the maximum weight of all subsetsS <Subscript> i </Subscript> is minimal,k-partitioning is strongly related to the...</subscript></subscript></subscript></subscript></subscript></subscript></subscript></subscript>

For multiobjective optimization problems, it is meaningful to compute a set of solutions covering all possible trade-offs between the different objectives. The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For...