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

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

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

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

This paper introduces $\Delta$-MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA's Deep Space Network (DSN) scheduling problem. work is an extension our original MILP (DOI:10.1109/ACCESS.2021.3064928) and inherits many its constructions strengths, including base formulation for DSN scheduling. To provide more feasible schedules with res...

Abstract We study linear bilevel programming problems, where (some of) the leader and follower variables are restricted to be integer. A discussion on relationships between optimistic pessimistic setting is presented, providing necessary sufficient conditions for them equivalent. new class of inequalities, optimality cuts, introduced. They used derive a single-level non-compact reformulation pr...