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 …

The bin packing problem with conflicts consists of packing items in a minimum number of
bins of limited capacity while avoiding joint assignments of items that are in conflict. Our …

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 …

Abstract We study the Knapsack Problem with Conflicts, a generalization of the Knapsack
Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously …

In this paper, a new branch-and-price-and-cut algorithm is proposed to solve the one-
dimensional bin-packing problem (1D-BPP). The 1D-BPP is one of the most fundamental …

Assessing a humanitarian transportation network at an early stage after disaster occurrence
plays a crucial role in the mitigation of casualties. As a class of uncrewed aerial vehicles …

We study the knapsack problem with conflict graph (KPCG), an extension of the 0-1
knapsack problem, in which a conflict graph describing incompatibilities between items is …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

The two-dimensional vector packing problem is a well-known generalization of the classical
bin packing problem. It considers two attributes for each item and bin. Two capacity …

In direct marketing, companies use sales campaigns to target their customers with
personalized product offers. The effectiveness of direct marketing greatly depends on the …