First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

We study the problem of reconstructing binary images from four projections data in a fuzzy environment. Given the uncertainly projections,w e want to find a binary image that respects as best as possible these projections. We provide an iterative algorithm based on fuzzy integer programming and linear membership functions.

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

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...

the aim of this study is to propose a new mixed integer linear programming (milp) model to find the minimum required number of yard cranes, rubber tyred gantry cranes (rtgcs), for completion the total amount of works at the end of planning horizon. in other word, we find the optimal number of yard cranes in a container terminal which completes the total amount of works. the paper supports the p...

research interests have been focused on the concept of penalizing jobs both for being early and for being tardy because not only of modern competitive industrial challenges of providing a variety of products at a very low cost by smoothing productions but also of its increasing and exciting computer applications. here, sequencing approaches of the mixed- model just-in-time production systems is...