An algorithm recently developed by Enkhbat et al. [3] based on continuous relaxation of the quadratic assignment problem generates suboptimal solution of good quality on average giving no sufficient enough verification on global optimality of the generated solution, whereas a branch and bound method provides a solution with verified global optimality, taking on input an upper bound close to glo...

Uncertain switched linear systems are known as an important class of control systems. Performance of these systems is affected by uncertainties and its stabilization is a main concern of recent studies. Existing work on stabilization of these systems only provides asymptotical stabilization via designing switching strategy and state-feedback controller. In this paper, a new switching strate...

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

We prove an (lg 2 n= lg lg n) lower bound for the depth of n-input sorting networks based on the shuue permutation. The best previously known lower bound was the trivial (lg n) bound, while the best upper bound is given by Batcher's (lg 2 n)-depth bitonic sorting network. The proof technique employed in the lower bound argument may be of independent interest.

It is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎Also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

In this paper the eccentric forward extrusion of sections has been simulated and analyzed using FEM Abaqus-explicit. The results have been compared to those obtained from upper bound theorem and experimental works. Close agreements was observed between the FEM and experimental work and as compared with the upper bound data more realistic and better predictions were made by the authors’ method. ...

Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...

It remains a challenging problem to tightly estimate the worst case response time of an application in a distributed embedded system, especially when there are dependencies between tasks. We discovered that the state-of-the art techniques considering task dependencies either fail to obtain a conservative bound or produce a loose upper bound. We propose a novel conservative performance analysis,...

We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of capacity these channels and prove matching upper lower bound on it in terms the conditional entropy. Our achievability (lower bound) proof is quantum generalisation work one authors (arXiv:2103.11548) which studied problem secure list decoding its application to bit-string commitment. The ...