نتایج جستجو برای: allocation problem bi level programming branch and bound full enumeration clustering
تعداد نتایج: 17074859 فیلتر نتایج به سال:
In the Berth Allocation Problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete c...
In Floudas and Visweswaran (1990, 1993), a deterministic global optimization approach was proposed for solving certain classes of nonconvex optimization problems. A global optimization algorithm, GOP, was presented for the solution of the problem through a series of primal and relaxed dual problems that provide valid upper and lower bounds respectively on the global solution. The algorithm was ...
Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem is then solved in the first ...
Inspired by methods and theoretical results from parameterised algorithmics, we improve the state of the art in solving Cluster Editing, a prominent NP-hard clustering problem with applications in computational biology and beyond. In particular, we demonstrate that an extension of a certain preprocessing algorithm, called the (k + 1)-data reduction rule in parameterised algorithmics, embedded i...
nowadays in trade and economic issues, prediction is proposed as the most important branch of science. existence of effective variables, caused various sectors of the economic and business executives to prefer having mechanisms which can be used in their decisions. in recent years, several advances have led to various challenges in the science of forecasting. economical managers in various fi...
the control problem and dynamic programming is a powerful tool in economics and management. we review the dynamic programming problem from its beginning up to its present stages. a problem which was involved in physics and mathematics in i 7” century led to a branch of mathematics called calculus of variation which was used in economic, and management at the end of the first quarter of the 20” ...
In this paper, a bi-level game-theoretic model is proposed to investigate the effects of governmental financial intervention on green supply chain. This problem is formulated as a bi-level program for a green supply chain that produces various products with different environmental pollution levels. The problem is also regard uncertainties in market demand and sale price of raw materials and pro...
There are different decision levels with distinct makers in a decentralized Supply Chain, for example, shippers and carriers. Nevertheless, most studies conducted considering only one decision-making level. The carrier is the agent Dynamic Vehicle Allocation (DVA) problem allocates vehicles to maximize its profit, usually delaying shipping. It necessary respect partnership principle. This paper...
With the rapid development of 5G networks, emerging mobile system is expected to serve a large number users with differentiated performance requirements. Different application scenarios have resource and quality service To optimize allocation network multidimensional resources, an algorithm maximize multi-dimensional utilization proposed for optimization problem Enhanced Mobile Broadband (eMBB)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید