This work addresses the correction and improvement of Mavrotas and Diakoulaki’s branch and bound algorithm for mixed 0-1 MOLP. We first develop about the issues encountered by the original algorithm and propose and corrected version for the biobjective case. We then introduce several improvements about the bounds and end with the proposition of a new algorithm based on the two phase method and ...

The cutwidth minimization problem consists of finding a linear layout of a graph so that the maximum linear cut of edges (i.e., the number of edges that cut a line between consecutive vertices) is minimized. This paper starts by reviewing previous exact approaches for special classes of graphs as well as a linear integer formulation for the general problem. We propose a branch and bound algorit...

We propose an exact branch-and-bound algorithm for the problem of maximizing the minimum machine completion time on identical parallel machines. The proposed algorithm is based on tight lower and upper bounds aswell as an effective symmetry-breaking branching strategy. Computational results performed on a large set of randomly generated instances attest to the efficacy of the proposed algorithm.

Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s state-of-the-art strong branching and pseudocost branching branching strategies for linear programming based branch-and...

The issue discussed in this paper is a bi-level problem in which two rivals compete in attracting customers and maximizing their profits which means that competitors competing for market share must compete in the centers that are going to be located in the near future. In this paper, a nonlinear model presented in the literature considering customer preferences is linearized. Customer behavior ...

We describe improvements to Smith’s branch-and-bound (B&B) algorithm for the Euclidean Steiner problem in IR. Nodes in the B&B tree correspond to full Steiner topologies associated with a subset of the terminal nodes, and branching is accomplished by “merging” a new terminal node with each edge in the current Steiner tree. For a given topology we use a conic formulation for the problem of locat...

In this paper, we studied the assembly line worker assignment and balancing problem, which is an extension of the classical assembly line balancing problem in which an optimal partition of the assembly work among the stations is sought along with the assignment of the operators to the stations. The relationship between this problem and several other well-studied problems is explored, and new lo...

Communities can intuitively be defined as subsets of nodes of a graph with a dense structure in the corresponding subgraph. However, for mining such communities usually only structural aspects are taken into account. Typically, no concise nor easily interpretable community description is provided. For tackling this issue, this paper focuses on description-oriented community detection using subg...

Computing the set of optimal solutions for a multiobjective constraint optimisation problem can be computationally very challenging. Also, when solutions are only partially ordered, there can be a number of different natural notions of optimality, one of the most important being the notion of Possibly Optimal, i.e., optimal in at least one scenario compatible with the inter-objective tradeoffs....

Utilization bound is a well-known concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. In this paper, we define the utilization bound as a function of the info...