W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...

The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include two-way, multiway, and multi-level partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning processes. To derive the optimum solutions, we describe the branch and bound method and the dynamic ...

Motivated by the call of International Maritime Organization to meet emission targets 2030, this study considers two important practical aspects quay crane scheduling: efficiency and energy consumption. More precisely, we introduce bi-objective scheduling problem where objective is minimize vessel’s completion time crane’s This done formulating a mixed-integer programming model. A branch-and-bo...

We propose a feasible active set method for convex quadratic programming problems with non-negativity constraints. This method is specifically designed to be embedded into a branch-and-bound algorithm for convex quadratic mixed integer programming problems. The branch-and-bound algorithm generalizes the approach for unconstrained convex quadratic integer programming proposed by Buchheim, Caprar...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...

ABSTRACT. Bi-level programming problems are an important type of multi-variable and double-layer programming problems. These problems appear everywhere especially in the industrial, supply-chain, and marketing programming applications. In this work, two new original approaches are proposed to solve bi-level quadratic programming problems in different cases: the so-called ergodic branch-and-boun...

Integer programming algorithms based on the ordered enumeration method are described. Combining dynamic programming and branch and bound ideas in one efficient computational process, S. S. Lebedev implemented his method for solving integer linear programming problems in 1968. A number of ordered enumeration algorithms were developed since the 1970's. The author has been actively involved in thi...

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in...

This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit enumeration is employed using bounds that are obtained from the fractional variables in the associated linear programming problem. The principal mathematical result used in obtaining these bounds is t...

This paper presents an approach to solve the problem of scheduling printed circuit board assemblies on single production line to minimize total weighted tardiness and total feeder setups, which are sequence dependent. Preemptive integer goal programming model is constructed to represent the bi-objective problem. Although an optimal branch-and-bound method is available, its computational require...