Titlebook: Mathematical Optimization Theory and Operations Research; 23rd International C Anton Eremeev,Michael Khachay,Panos Pardalos Conference proc

无孔

One Optimization Problem Induced by the Segregation Problem for the Sum of Two Quasiperiodic Sequenche framework of a posteriori approach, of the noise-proof segregation problem for two independent unobservable quasiperiodic sequences, i.e., the sequences that include some non-intersecting subsequences-fragments having the predetermined characteristic properties with the limitations from below and

忙碌

On 1-Skeleton of the Cut Polytopesh whose vertex set is the vertex set of the polytope, and the edge set is the set of geometric edges or one-dimensional faces of the polytope..We study the diameter and the clique number of 1-skeleton of cut polytopes for several classes of graphs. These characteristics are of interest since they es

occult

Temporal Bin Packing Problems with Placement Constraints: MIP-Models and Complexityng. We suppose that items are organized into .. All items in the same batch are placed simultaneously. In cloud computing, items correspond to virtual machines (VMs) and batches correspond to user requests for VM placement. In addition, cloud users can create . consisting of VMs united by a single p

血统

Branching Algorithms for the Reliable Production Process Design Problemt digraph .. Such an embedding is performed by some one-to-one map . defined on the node set . such that, for each arc (., .) of ., there exists an elementary .(.)-.(.)-path in ., and all such paths are vertex-disjoint. In this paper we consider the proposed recently Reliable Production Process Desi

别炫耀

The Problem of Planning Investment Projects with Lendingg problem (RCPSP) is described. The next option for solving the problem with the criterion of maximizing net present value (NPV) from the entire project. The only type of resource used is financial, since all other resources are exchanged in monetary terms, and cash flows can be exchanged at any tim

GRAIN

Stochastic Greedy Algorithms for a Temporal Bin Packing Problem with Placement Groupshines. Bins are grouped together into racks. The main difference from the classical bin packing problem is that items are organized into placement groups, which are subdivided into subgroups. Items from different subgroups of the same group conflict and cannot be placed on the same rack..The additio