The ‘Progressive Party Problem’ [9] has long been considered a problem intractable for branch-and-bound mixed integer solvers. Quite impressive results have been reported with constraint programming systems for this problem. As a result the problem has become a standard example in texts on constraint programming. Fortunately, there has been progress in the mixed integer programming arena: we ca...

This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (plsp) with identical parallel machines and set-up times overlapping two periods. The proposed model assumes constant period length and explicitly calculates the distribution of set-up operations among periods. The presented results of computational experiments with standard mip methods prove that ...

Using constraint programming (CP), we address the taskmapping problem in data-driven macroprogramming for wireless sensor networks (WSNs). A task graph representing the flow of data among tasks assists the application developer in specifying the features of a WSN at a high level of abstraction. A problem that arises in this context is how to map the tasks to nodes in the target network before t...

We present an exact Mixed Integer Programming (MIP) solution scheme where a set covering model is used to find a small set of first-choice branching variables. In a preliminary “sampling” phase, our method quickly collects a number of relevant lowcost fractional solutions that qualify as obstacles for the Linear Programming (LP) relaxation bound improvement. Then a set covering model is solved ...

This paper addresses a multi-objective optimization problem for marine monitoring using USV. The objectives are to cover the maximum area with lowest energy cost while avoiding collisions. is solved an exact and heuristic methods. First, Mixed Integer Programming formulation proposed model USV problem. It consists of combination Covering Salesman Problem (CSP) Travelling Profit (TSPP). Then, we...

this paper proposes a new mathematical model for the integrated procurement-production-distribution problem of a fuzzy mixed integer linear programming (fmilp) type. considering the uncertainty in real problems, a number of parameters such as demand, capacity, and cost where their values are not available or known precisely, have been considered as trapezoidal fuzzy numbers. to solve fuzzy mixe...

This paper deals with the problem of finding optimal feeding sequence in a manufacturing cell with feeders fed by a mobile robot with manipulation arm. The performance criterion is to minimize total traveling time of the robot in a given planning horizon. Besides, the robot has to be scheduled in order to keep production lines within the cell working without any shortage of parts fed from feede...

This paper addresses the problem of determining the work schedule, called medical planning, of oncologists for chemotherapy of oncology patients at ambulatory care units. A mixed integer programming (MIP) model is proposed for medical planning in order to best balance bed capacity requirements under capacity constraints of key resources such as beds and oncologists. The most salient feature of ...

This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information functions across pools and within each content area...

Here, we consider single vendor-buyer model with multi-product and multi-customer and multi-facility location-production-distribution problem. It is assumed that the players of the supply chain are coordinated by sharing information. Vendor manufactures produce different products at different plants with limited capacities and then distribute the products to the consumers according to determini...