Dynamic pricing has become a common form of electricity tariff, where the price of electricity varies in real time based on the realized electricity supply and demand. Hence, optimizing industrial operations to benefit from periods with low electricity prices is vital to maximizing the benefits...

With the rising fuel costs, ride sharing is becoming a common mode of transportation. Sharing taxis which has been prominent in several developing countries is also becoming common in several cities around the world. Sharing taxis presents several advantages as it minimizes vacant seats in cars...

We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)

We propose a simple exact algorithm for solving the generalized assignment problem. Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we apply variable-fixing rules to solve these effectively. The decision problems are solved by a...

The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving...

Although the Lagrangian method is a powerful dual search method in integer programming, it often fail to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong...

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish...

In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root...