We consider a Stackelberg pricing problem in directed networks:Tariffs (prices) have to be defined by an operator, the leader, for a subset of the arcs. Clients, the followers, choose paths to route their demand through the network selfishly and independently of each other, on the basis of...

The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers with known valuations. The problem is (weakly) NP-hard and a recent quasi-PTAS suggests that a PTAS might be in reach. Yet, so...

We consider a profit maximization problem when pricing a set of m items which can be represented as the edges of an undirected multi graph G. There is a set of n customers, each of which is interested in purchasing a bundle of edges of G, and we assume that these edges form a simple path in G....

We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to...

In this paper we consider an ILP-based approach to tackle the problem of determining a treewidth of the graph. We give an overview of existing attempts and develop further LP-based techniques for the problem. We present two different ILP formulations for the treewidth. To obtain the first one we...

This paper addresses two-dimensional trajectory optimization problems, where the mover''s speed monotonically decreases/increases in one of the space''s coordinates. For instance, it is well-known that the absolute value of the helicopter speed decreases in altitude because air pressure drops....