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...

Abstract Local search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes current solution and returns set similar solutions, denoted as neighbors. In best improvement local search, neighboring solutions replaces each iteration. On other hand, first only explored until any improving found, which then solution. this work we propose new strategy for tha...

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

extensive research has been devoted to economic production quantity (epq) problem. however, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. in this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...

Local Search James M. Crawford i2 Technologies 909 East Las Colinas Boulevard Irving, TX 75039 [email protected] Mukesh Dalal i2 Technologies 909 East Las Colinas Boulevard Irving, TX 75039 [email protected] Joachim P. Walser Programming Systems Lab Univ. des Saarlandes, Postfach 151150 66041 Saarbrücken, Germany