What is the relation between notion of Nash equilibria and Pareto-optimal points? It well known that do not need to be Pareto optimal, points equilibria. However, paper “Characterizing Computing Set Equilibria via Vector Optimization” by Feinstein Rudloff takes a deeper look at relation. shown it possible characterize set all as solutions certain vector optimization problem. This accomplished c...

Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching–Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disass...

We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using several temporal planners to compile cir...

In this paper we propose a new method to solve biobjective combinatorial optimization problems of the max-ordering type. The method is based on the two-phases method and ranking algorithms to eÆciently construct K best solutions for the underlying (single objective) combinatorial problem. We show that the method overcomes some of the diÆculties of procedures proposed earlier. We illustrate this...

We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and allow highly parallel plans. We report on experiments using several temporal planners to compile ci...

In the relational database setting today, large queries containing many joins are becoming increasingly common. In general the ordering of join-operations is quite sensitive and can have a devastatingly negative effect on the efficiency of the DBMS. Scheufele and Moerkotte proved that join-ordering is NP-complete in the general case [4]. For smaller queries however, less than approximately 10 j...

In vector optimization with a variable ordering structure the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications it was started to develop a comprehensive theory for these vector optimization problems. Thereby also notions of proper efficiency were generalized to variable ordering structu...

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

a real-time optimization (rto) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. furthermore, the objective function is penalized by a fuzzified form of the key process constraints. to enable using conventional optimization techniques, the resulting fuzzy optimization problem is then re...