Combinatorial optimization and integer programming form the backbone of decision-making models in which discrete choices must be made under constraints. At its core, integer programming specialises in ...
We study a class of integer bilevel problems, the so-called Integer Linear Multiplicative Bilevel Problem, ILMBP, where the constraints are linear and both the upper level problem and the lower level ...
remove-circle Internet Archive's in-browser bookreader "theater" requires JavaScript to be enabled. It appears your browser does not have it turned on. Please see ...
ABSTRACT: This article examines some of the properties of quasi-Fejer sequences when used in quasi-gradiental techniques as an alternative to stochastic search techniques for optimizing unconstrained ...
This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer ...
Prior to SageMath 9.1, CPLEXBackend was available as part of the SageMath source tree, from which it would be built as an "optional extension" if the proprietary ...
Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. There is a need for design strategies that can support rapid and widespread deployment ...
Abstract: Existing linearized section location methods for distribution networks are only applicable to single faults. In response, this paper proposes a linear integer programming method for section ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results