Mathematical programming representation has been recently used to describe the behavior of discrete event systems as well as their formal properties. This new way of representing discrete event systems paves the way to the creation of simpler mathematical programming models that reduce the...

Some regularization methods, including the group lasso and the adaptive group lasso, have been developed for the automatic selection of grouped variables (factors) in conditional mean regression. In many practical situations, such a problem arises naturally when a set of dummy variables is used...

Nepal has a long history of returning public forests to local people as part of its community forestry programme. In principle the community forestry programme is designed to address both environmental quality and poverty alleviation. However, concern has been expressed that forest policies...

A Location-Routing Problem (LRP) combines two difficult problems, facility location and vehicle routing, and as such it is inherently hard to solve. In this paper, we propose a different formulation approach than the common arc-based product-flow (Arc-BPF) approach in the literature. We...

We provide a modeling framework for banks’ business planning under Basel III. For this purpose, we write banks’ planning as a formal optimization problem where Basel III minimum requirements/ratios enter as constraints. The linear program provides dual variables that are interpreted as...

In the paper Li et al. [A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem. Omega 2012;40:210–7] it is claimed that a theoretical result appeared in Montemanni and Gambardella [Exact algorithms for the minimum power symmetric connectivity problem in...