نتایج جستجو برای: storage mixed integer linear programming

تعداد نتایج: 1153922  

Journal: :IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2000

Journal: :Transportation Research Record: Journal of the Transportation Research Board 2016

Journal: :Optimization and Engineering 2021

Abstract A mathematical model is introduced to solve a mobile workforce management problem. In such problem there are number of tasks be executed at different locations by various teams. For example, when an electricity utility company has deal with planned system upgrades and damages caused storms. The aim determine the schedule teams in way that overall cost minimal. involves scheduling. foll...

2008
Fred Glover

Recent adaptive memory and evolutionary metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide the search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values, and in strategies that use linear programming to generate trial solu...

Journal: :مدیریت صنعتی 0
علی محقر دانشیار مدیریت صنعتی، دانشکدۀ مدیریت، دانشگاه تهران، تهران، ایران محمدرضا مهرگان استاد مدیریت صنعتی، دانشکدة مدیریت، دانشگاه تهران، تهران، ایران عادل آذر استاد مدیریت صنعتی، دانشکدة مدیریت و اقتصاد، دانشگاه تربیت مدرس، تهران، ایران ناصر مطهری فریمانی استادیار مدیریت، دانشکدة علوم اداری و اقتصاد، دانشگاه فردوسی، مشهد، ایران

much research hasn’t been done in the area of project selection in the public sector. in this paper, we tried to choose projects in the public sector, and a linear programming model is presented. in an effort to build the model, the decision criteria were identified using the delphi method and then the criteria were reviewed at conceptual combining. the model was constructed in a linear, goal a...

2008
Kanika Dhyani Leo Liberti

We discuss a mixed-integer nonlinear programming formulation for the problem of covering a set of points with a given number of slabs of minimum width, known as the bottleneck variant of the hyperplane clustering problem. We derive several linear approximations, which we solve using a standard mixed-integer linear programming solver. A computational comparison of the performance of the differen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید