The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Timing problems involve the choice of task execution dates within a predetermined processing sequence, and under various additional constraints or objectives such as time windows, time‐dependent costs, or flexible processing times, among others. Their efficient resolution is critical in branch and bound and neighborhood search methods for vehicle routing, project and machine scheduling, as well as...
The aircraft scheduling problem (ASP) is the real‐time problem of scheduling takeoff and landing operations at a congested airport in a given time horizon, taking into account the runways and the air segments in the terminal maneuvering area . The ASP can be viewed as a job shop scheduling problem with additional real‐world constraints. Compared with the current literature based on job shop scheduling...
Flows over time problems relate to finding optimal flows over a capacitated network where transit times on network arcs are explicitly considered. In this article, we study the problem of determining a minimum cost origin‐destination path where the cost and the travel time of each arc depend on the time taken to travel from the origin to that particular arc along the path. We provide computational...
We study two p‐center models on a network with probabilistic demand weights. In the first, which is called the maximum probability p‐center problem, the objective is to maximize the probability that the maximum demand‐weighted distance between the demand and the open facilities does not exceed a given threshold value. In the second, referred to as the β‐VaR p‐center problem, the objective is to minimize...
The Weighted Safe Set Problem requires to partition an undirected graph into two families of connected components, respectively denoted as safe and unsafe, in such a way that each safe component dominates the unsafe adjacent components with respect to a weight function. We introduce a combinatorial branch and bound approach, whose main strength is a refined relaxation that combines graph manipulations...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.