Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...