نتایج جستجو برای: lagrangian relaxation
تعداد نتایج: 98703 فیلتر نتایج به سال:
Recently, researchers have proposed decision support tool for generating suggestions for bids in combinatorial reverse auction based on disclosure of bids. An interesting issue is to design an effective mechanism to guide the bidders to collectively minimize the overall cost without explicitly disclosing the bids. We consider a winner determination problem for combinatorial reverse auction and ...
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exact solutions provided by a Lagrangian decomposition of this formulation in which only one constraint is relaxed. Some computational experiments were carried out with an effective multi-threaded implementation of our a...
We consider dynamic selection problems, where a decision maker repeatedly selects a set of items from a larger collection of available items. A classic example is the dynamic assortment problem, where a retailer chooses items to offer for sale subject to a display space constraint. The retailer may adjust the chosen assortment over time in response to the observed demand. These dynamic selectio...
In this paper we consider the problem of minimizing a nonconvex quadratic function, subject to two quadratic inequality constraints. As an application, such quadratic program plays an important role in the trust region method for nonlinear optimization; such problem is known as the CDT subproblem in the literature. The Lagrangian dual of the CDT subproblem is a Semidefinite Program (SDP), hence...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید