The decomposition of the movement of the eye into different categories is critical to their study. According to the algorithm used, some movements may signi...

In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...

There are currently several systems to collect online writing data in keystroke logging. Each of these systems provides reliable and very precise data. Unf...

An <i>r</i>-equitable <i>k</i>-coloring <i>c</i> of a graph <i>G=(V,E)</i> is a partition of <i>V</i> into <i>k</i> stable sets <img src="/cgi-bin/mimetex.cg...

It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....

Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear ...

We study the welfare effects of Price Cap Regulation (PCR) and the strategic behaviour it may induce in gas transportation networks by analyzing a stylized g...

The asymmetric distance--constrained vehicle routing problem, consists of finding vehicle tours to connect all customers with a depot, such that the to...

We present a Variable Neighborhood Search approach to solving the one-commodity pickup-and-delivery travelling salesman problem. It is characterized by a s...

Given a graph <i>G</i> and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divid...

Censored quantile regression models are very useful for the analysis of censored data when standard linear models are felt to be appropriate. However, fitt...

In this paper an effective modification to the original Nelder-Mead simplex method is suggested. It is shown that the new heuristic outperforms on average ...

In this paper we consider two similar NP-hard optimization problems on graphs: the metric dimension problem and the problem of determining minimal doubly r...

Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous optimization problems. In this ...

This paper explores new connections between the satisfiability problem and semidefinite programming. We show how the process of resolution in satisfiability...

This chapter provides an overview of cone optimization models for facility layout and VLSI floorplanning problems. We focus on two classes of problems to w...

Parameterizing source code for architecture-bound optimization is a common approach to high-performance programming but one that makes the programmer's task ...

This paper presents an hybrid Variable Neighborhood-Tabu Search algorithm to solve the Site Dependent Vehicle Routing Problem (SDVRPTW). Our implementation o...

We extend the contingent claims framework for the levered firm in explicitly modeling the resolution of financial distress under formal bankruptcy as a non-c...

We investigate the optimum control of a stochastic system, in the presence of both exogenous (control-independent) stochastic state variables and endogenous...