The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem. We are concerned here with online versions of a generalization of the TSP on metric spaces where the server doesn’t have to accept all requests. Associated with each request (to visit a point in the metric space) is a penalty (incurred if the request is rejected). Requests are revealed over time to a server...

We consider an online learning problem on a continuum. A decision maker is given a compact feasible set S, and is faced with the following sequential problem: at iteration t, the decision maker chooses a distribution x ∈ ∆(S), then a loss function ` : S → R+ is revealed, and the decision maker incurs expected loss 〈 `, x 〉 = Es∼x(t) ` (s). We view the problem as an online convex optimization pr...

In this work an alternative online variant of the matching problem in bipartite graphs is presented. It is motivated by a scheduling problem in an online environment. In such an environment, a task is unknown up to its disclosure. However, in that moment it is not necessary to take a decision on the service of that particular task. In reality, an online scheduler has to decide on how to use the...

We investigate a supply chain decision problem that encompasses three challenges, which cannot be managed satisfactorily nowadays with computerized decision support: dynamic, islands of planning autonomy and hierarchically coupled planning goals. We combine the existing online optimization framework by a closed-loop optimization control circuit that allows a subordinate service centre agent to ...

People have access to experiential information and advice about health online. The types of advice exchanged affect the nature of online communities and potentially patient decision making. The aim of this study was to examine the ways in which peers exchange advice within an online health forum in order to better understand online groups as a resource for decision making. Messages collected ov...

With large student enrollment, MOOC instructors face the unique challenge in deciding when to intervene in forum discussions with their limited bandwidth. We study this problem of instructor intervention. Using a large sample of forum data culled from 61 courses, we design a binary classifier to predict whether an instructor should intervene in a discussion thread or not. By incorporating novel...

We consider a two-stage decision problem, in which an online retailer first makes optimal decisions on his profit margin and free-shipping threshold, and then determines his inventory level. We start by developing the retailer’s expected profit function. Then, we use publiclyavailable statistics to find the best-fitting distribution for consumers’purchase amounts and the best-fitting function f...

For the experts problem (and its close relative B1/B∞ linear game) we have developed a deterministic method (Exponential Weights) and a randomized method (Follow the Perturbed Leader). Both the deterministic and randomized methods extend to other online prediction problems where the loss is linear in the decision of the learner and linear in the outcome. We have seen that the geometry of the tw...

In this paper we address several variants of the polygon an-nulus placement problem: given an input polygon P and a set S of points, nd an optimal placement of P that maximizes the number of points in S that fall in a certain annulus region deened by P and some ooset distance > 0. We address the following variants of the problem: placement of a convex polygon as well as a simple polygon; placem...

This study applies Five Forces Analysis to evaluate and select market segments for international business using a strategy-aligned fuzzy approach. An illustration segment evaluation procedure is used to demonstrate that our procedure is an effective quantification approach for integrating five forces, generic strategies and marketing information in a group decision-making process. The final dec...