We propose ODPOP, a new distributed algorithm for open multiagent combinatorial optimization that feature unbounded domains (Faltings & Macho-Gonzalez 2005). The ODPOP algorithm explores the same search space as the dynamic programming algorithm DPOP (Petcu & Faltings 2005b) or ADOPT (Modi et al. 2005), but does so in an incremental, best-first fashion suitable for open problems. ODPOP has seve...

A parallel matheuristic algorithm is presented as a spin-off from the exact Branch-and-Fix Coordination (BFC) algorithm for solving multistage stochastic mixed 0-1 problems. Some steps to guarantee the solution’s optimality are relaxed in the BFC algorithm, such that an incomplete backward branching scheme is considered for solving large sized problems. Additionally, a new branching criterion i...

This paper firstly introduces the E-commerce and deeply explores current status of Chinese B2B E-commerce and problems existing in small and medium-sized enterprises. Secondly, based on the study of the E-commerce, the author studies successful business model of Alibaba and Made-in-China. Finally, according to Alibaba’s and Made-in-China’s successful business model experience, the author reflec...

in this study, preparation of nano-sized gamma alumina with high specific surface area and high yield by thereaction between aluminum nitrate and sodium carbonate, without using any surfactant is reported. bohemite (aluminum oxyhydroxide) was prepared as a precursor by strict control of ph and reaction temperature. the gel produced was purified by washing followed by centrifugation. the specifi...

A “less than truckload” (LTL) network organises the transport of small shipping volumes by truck between given depots. To be cost-efficient it is necessary to bundle and unbundle goods on their way, using depots as so-called hubs. Our aim is to develop a strategic plan which is cost-optimal for given average shipping volumes. We consider transshipment and transport costs; to give a realistic es...

The availability of annotated data (with as rich and “deep” annotation as possible) is desirable in any new developments. Textual data are being used for so-called training phase of various empirical methods solving various problems in the field of computational linguistics. While there are many methods that use texts in their plain (or raw) form (in most cases for so-called unsupervised traini...

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...

This article considers the problem of scheduling preemptive open shops to minimize total tardiness. The problem is known to be NP-hard. An efficient constructive heuristic is developed for solving large-sized problems. A branch-and-bound algorithm that incorporates a lower bound scheme based on the solution of an assignment problem as well as various dominance rules are presented for solving me...

The solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distan...