LetG=(U,V,E) be a bipartite graph with weights of its edgesc <Subscript> ij </Subscript>. For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E <Subscript>o</Subscript> is the set of edgesij withx <Subscript> ij </Subscript>=0 for each optimum solution (0-persistent...</subscript></subscript></subscript>

This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n ×n) matrices that are not degenerate projective planes. The application of this algorithm forn ≤ 12 yielded 20 such matrices, adding 5 matrices to the 15 previously known. For greater...

We consider scheduling a single server in a two-class M/M/1 queueing system with finite buffers subject to holding costs and rejection costs for rejected jobs. We use dynamic programming to investigate the structural properties of optimal policies. Provided that the delay of serving a job is...

Whilst most of the literature on topology optimization of structures deals with so-called selfadjoint problems involving highly idealized, single-purpose structures, this paper discusses topology optimization of multi-purpose structures which concerns “nonselfadjoint” problems. General...

The paper deals with a class of discrete-time Markov control processes with Borel state and action spaces, and possibly unbounded one-stage costs. The processes are given by recurrent equations x <Subscript> t </Subscript> <Subscript>+1</Subscript>=F(x <Subscript> t </Subscript>,a <Subscript> t </Subscript>,ξ<Subscript> t </Subscript>), t=1,2,… with i.i.d. ℜ<Superscript> k </Superscript>– valued random vectors ξ<Subscript> t </Subscript> whose...</subscript></superscript></subscript></subscript></subscript></subscript></subscript>

Expected recourse functions in linear two-stage stochastic programs with mixed-integer second stage are approximated by estimating the underlying probability distribution via empirical measures. Under mild conditions, almost sure uniform convergence of the empirical means to the original...

We consider the optimal control problem of an M <Superscript> X </Superscript>/G(Q)/1 batch service queueing system with Q∞. So, we assume that customers arrive according to a compound Poisson process and are served in batches not greater than the finite service capacity Q. The control problem involves the determination...</superscript>

Wolfe and Mond-Weir type symmetric minimax dual variational problems are formulated and usual duality theorems are established under convexity-concavity and pseudoconvexity-pseudoconcavity hypotheses respectively on the function <InlineEquation ID="Equ1"> <EquationSource Format="TEX"/> </InlineEquation> that appears in the two distinct dual pairs. Under an additional...</inlineequation>

The “Montagnes Russes” algorithm for finding the global minima of a lower semi-continuous function (thus involving state constraints) is a descent algorithm applied to an auxiliary function whose local and global minima are the global minima of the original function. Although this auxiliary...

Thek-partitioning problem is defined as follows: Given a set of items {I <Subscript>1</Subscript>,I <Subscript>2</Subscript>,...,I <Subscript>n</Subscript>} where itemIj is of weightwj ≥ 0, find a partitionS <Subscript>1</Subscript>,S <Subscript>2</Subscript>,...,S <Subscript> m </Subscript> of this set with ¦S <Subscript> i </Subscript>¦ =k such that the maximum weight of all subsetsS <Subscript> i </Subscript> is minimal,k-partitioning is strongly related to the...</subscript></subscript></subscript></subscript></subscript></subscript></subscript></subscript>