We develop and implement methods for determining whether relaxing sparsity constraints on portfolios improves the investment opportunity set for risk-averse investors. We formulate a new estimation procedure for sparse second-order stochastic spanning based on a greedy algorithm and Linear...

We develop and implement methods for determining whether relaxing sparsity constraints on portfolios improves the investment opportunity set for risk-averse investors. We formulate a new estimation procedure for sparse second-order stochastic spanning based on a greedy algorithm and Linear...

Background: This paper addresses a new class of scheduling problems in the context of machines subject to (unrecoverable) interruptions; i.e., when a machine fails, the current and subsequently scheduled work on that machine is lost. Each job has a certain processing time and a reward that is...

We develop and implement methods for determining whether relaxing sparsity constraints on portfolios improves the investment opportunity set for risk-averse investors. We formulate a new estimation procedure for sparse second-order stochastic spanning based on a greedy algorithm and Linear...

A classic result of Korte and Hausmann [1978] and Jenkyns [1976] bounds the quality of the greedy solution to the problem of finding a maximum value basis of an independence system (E,ℐ)$$ \left(E,\mathcal{I}\right) $$in terms of the rank‐quotient. We extend this result in two ways. First,...

The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...

The received characterizations of feasible interim allocations are mostly in the spirit of Border (1991): Fix a family of sets, each containing some player-types, and test the interim allocation under consideration against all these sets. In the published literature, such Border-like...

This paper discusses the makespan minimization of a production batch within a specific concurrent system, seru production system. A seru production system consists of multiple independent serus. A seru is a compact assembly origination in which products are assembled...

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...

Predictive power has always been the main research focus of learning algorithms with the goal of minimizing the test error for supervised classification and regression problems. While the general approach for these algorithms is to consider all possible attributes in a dataset to best predict...

"This book explores the aspects of industrial portfolio management with reference to proper selection of financial instruments in a financial portfolio management scenario from a metaheuristic approach. It also illustrates the common measures used for the evaluation of risks/returns of...

"This book addresses the main strategies to build able algorithms for building better picking orders. It also examines the most common picking aspects in warehouse environments, ranging from manual order picking systems, automated retrieval systems, and related topics. Additionally, the book...

"This book explores the aspects of industrial portfolio management with reference to proper selection of financial instruments in a financial portfolio management scenario from a metaheuristic approach. It also illustrates the common measures used for the evaluation of risks/returns of...