The large neighborhood search (LNS) framework introduced by Shaw [11] provides a powerful hybridization of Local Search (LS) and Constraint Programming (CP). The idea of LNS is to combine the expressiveness of CP and the efciency of Local Search (LS) without requiring any meta-heuristic. LNS consists in improving a best-so-far solution by iteratively relaxing it and optimizing this solution usi...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

The capacitated miinimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node. The CMST problem is an NP-complete problem, and existing exact algorithms can solve only small size problems. Currently, the best available heuristic procedures for the CMST problem are tabu search alg...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

in this paper, a comprehensive model is proposed to design a network for multi-period, multi-echelon, and multi-product inventory controlled the supply chain. various marketing strategies and guerrilla marketing approaches are considered in the design process under the static competition condition. the goal of the proposed model is to efficiently respond to the customers’ demands in the presenc...

The capacitated minimum spanning tree (CMST) problem is to 3nd a minimum cost spanning tree in a network where nodes have speci3ed demands, with an additional capacity constraints on the subtrees incident to a given source node s. The capacitated minimum spanning tree problem arises as an important subproblem in many telecommunication network design problems. In a recent paper, Ahuja et al. (Ma...