During the last decade, significant progresses have been made in solving the Protein Threading Problem (PTP). However, all previous approaches to PTP only perform global sequence–structure alignment. This obvious limitation is in clear contrast with the ”world of sequences”, where local sequence-sequence alignments are widely used to find functionally important regions in families of proteins. ...

in this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. the constraints are the warehouse capacity and the batch forms of the order placements. the first objective of this problem is to find the order quantities such that the expected ...

This paper proposes a new mathematical model for the open pit mine planning problem, based on continuous functional analysis. The traditional models for this problem have been constructed by using discrete 0−1 decision variables, giving rise to large-scale combinatorial and Mixed Integer Programming (MIP) problems. Instead, we use a continuous approach which allows for a refined imposition of s...

We present mixed integer programming approaches for optimally solving a combinatorial optimization problem arising in network design with additional quality of service constraints. The rooted delayand delay-variation-constrained Steiner tree problem asks for a cost-minimal Steiner tree satisfying delay-constraints from source to terminals and a maximal variation-bound between particular termina...

majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the cap...

In this paper, the exam booklet distribution plan for Higher Education Institutions Exam (HEIE) is studied. The accurate important to decrease transportation cost and use capacity efficiently. booklets should be considered as capacitated vehicle routing problem (VRP). context, aim of paper minimizing cost/distance from depot where are kept schools with vehicles. case Gaziantep city 135 nodes (o...

Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though have potential to be exponentially more efficient than CDCL in theory, practice they can sometimes get hopelessly stuck even when programming (LP) relaxation is infeasible over reals. Inspired mixed (MIP), we address this problem i...

The Aircraft Arrival/Departure Problem (AADSP) is the core problem in current runway system, even has become bottleneck to prevent improvement of airport efficiency. This paper studies single AADSP. A Mixed Integer Programming (MIP) model constructed and an algorithm named Ant Colony based on Rank 2 Matrix Approximation (RMA-AC) method proposed. Numerical results validate that new algorithm, as...

The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximizes the strike force potential. Integer programming formulations are developed, semi-real and random problems are built up, and computational results via the CPLEX MIP Solver are presented.