It is shown that a piecewise linear function on a convex domain in R can be represented as a boolean polynomial in terms of its linear components.

We learn sensor trees from training data to minimize sensor acquisition costs during test time. Our system adaptively selects sensors at each stage if necessary to make a confident classification. We pose the problem as empirical risk minimization over the choice of trees and node decision rules. We decompose the problem, which is known to be intractable, into combinatorial (tree structures) an...

We make a novel connection between an energy-efficient wireless transmission scheduling problem and a multi-period, multi-item inventory control problem with stochastic convex ordering costs, deterministic demands, and a joint budget constraint. In the special case of a single item, we show that a state-dependent modified base-stock policy is optimal when the stochastic ordering costs are linea...

In this paper we consider a semi-infinite relaxation of mixed integer linear programs. We show that minimal valid inequalities for this relaxation correspond to maximal latticefree convex sets, and that they arise from nonnegative, piecewise linear, positively homogeneous, convex functions.

The discretization of control functions by piecewise constant and piecewise linear functions is considered for linear-quadratic elliptic optimal control problems. Error estimates are derived for the optimal controls. Special emphasis is laid on the case of boundary control and convex polygonal domains.

This paper reports the development of a Matlab toolbox for computational analysis of piecewise linear systems. The analysis is based on piecewise quadratic Lyapunov functions, which are computed via convex optimization. In this way, exponential stability and system performance can be assessed. The toolbox also supports efficient simulation of systems with discontinuous dynamics and sliding mode...

Convex relaxations of multilabel problems have been demonstrated to produce provably optimal or near-optimal solutions to a variety of computer vision problems. Yet, they are of limited practical use as they require a fine discretization of the label space, entailing a huge demand in memory and runtime. In this work, we propose the first sublabel accurate convex relaxation for vectorial multila...

Optimal Piecewise Linear Income Taxation Given its significance in practice, piecewise linear taxation has received relatively little attention in the literature. This paper offers a simple and transparent analysis of its main characteristics. We fully characterize optimal tax parameters for the cases in which budget sets are convex and nonconvex respectively. A numerical analysis of a discrete...

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

This paper addresses the following collision detection problem: determine the collision status for a pair of stationary convex polyhedral objects whose allowed deformation is uniform but arbitrary scaling of vertices within given upper and lower limits. We present an exact overlap checking method based on the characterization of all contact configurations. The set of all scaling pairs that two ...