Stochastic user equilibrium models are fundamental to the analysis of transportation systems. Such models are typically developed under the assumption of route based choice models for the users. A class of link based models under a Markovian assumption on the route choice behavior of the users has been proposed to deal with the drawbacks of … Read more
This paper is concerned with the rank constrained optimization problem whose feasible set is the intersection of the rank constraint set $\mathcal{R}=\!\big\{X\in\mathbb{X}\ |\ {\rm rank}(X)\le \kappa\big\}$ and a closed convex set $\Omega$. We establish the local (global) Lipschitzian type error bounds for estimating the distance from any $X\in \Omega$ ($X\in\mathbb{X}$) to the feasible set and … Read more
We reformulate the zero-norm minimization problem as an equivalent mathematical program with equilibrium constraints and establish that its penalty problem, induced by adding the complementarity constraint to the objective, is exact. Then, by the special structure of the exact penalty problem, we propose a decomposition method that can seek a global optimal solution of the … Read more
This article analyzes how the Unit Commitment Problem (UCP) complexity evolves with respect to the number n of units and T of time periods.A classical reduction from the knapsack problem shows that the UCP is NP-hard in the ordinary sense even for T=1. The UCP is proved to be strongly NP-hard.When either a unitary cost … Read more
The aim of Network Design Problem with Vulnerability Constraints (NDPVC), introduced by Gouveia and Leitner [EJOR, 2017], is to design survivable telecommunications networks that impose length bounds on the communication paths of each commodity pair, before and after the failure of any k links. This problem was proposed as an alternative to the Hop-Constrained Survivable … Read more
In entry-exit gas markets as they are currently implemented in Europe, network constraints do not affect market interaction beyond the technical capacities determined by the TSO that restrict the quantities individual firms can trade at the market. It is an up to now unanswered question to what extent existing network capacity remains unused in an … Read more
In this study, we consider the special case of the uncapacitated p-hub center problem, where the weight/flow matrix includes 0 entities. In some real life networks, such as airline networks, cargo networks etc., the zero flow might exist between certain demand points. Typically in airline networks, nobody travels from city i to city i. In … Read more
A regular timetable is a collection of events that repeat themselves every specific time span. This even structure, whenever applied at a whole network, leads to several benefits both for users and the company, although some issues are introduced, especially about dimensioning the service. It is therefore fundamental to properly consider the interaction between the … Read more
In this paper we present a four-level market model that accounts for airport capacity extension, fleet investment, aircraft scheduling, and ticket trade in a liberalized aviation market with independent decision makers. In particular, budget-constrained airports decide on the first level on their optimal runway capacity extension and on a corresponding airport charge. Airports anticipate optimal … Read more
We focus on solving robust principal component analysis (RPCA) arising from various applications such as information theory, statistics, engineering, and etc. We adopt a model to minimize the sum of observation error and sparsity measurement subject to the rank constraint. To solve this problem, we propose a two-step alternating minimization method. In one step, a … Read more