We present a procedure for self calibration of a pinhole camera subject to radial distortion. Radial distortion parameters are estimated using a nonlinear le...

Frequency hopping is a feature in GSM (Global System for Mobile Communications) cellular systems in which a frequency carrying the communication rapidly chan...

We consider a maritime inventory routing problem in the liquefied natural gas (LNG) business. Here, an actor is responsible for the routing of the fleet of s...

This paper addresses the split delivery vehicle routing problem with time windows (SDVRPTW) that consists of determining least-cost vehicle routes to service...

The minimum weight feedback vertex set problem (FVS) on series-parallel graphs can be solved in <i>O(n)</i> time by dynamic programming. This solution, howev...

Meaning cannot be based on dictionary definitions all the way down: at some point the circularity of definitions must be broken in some way, by grounding the...

We propose a class of projected Krylov methods for the solution of unsymmetric augmented systems of equations such as those arising from the finite-element f...

This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a ...

Column generation algorithms are instrumental in many areas of applied optimization, where linear programs with an enormous number of columns need to be so...

Location-allocation problems arise in several contexts, including supply chain and data mining. In its most common interpretation, the basic problem consists...

The aim of this paper is to propose a model for the design of a robust rapid transit network. In this paper, a network is said to be robust when the effect o...

The bidline scheduling problem with equity arises in several North American airlines. It consists of determining anonymous monthly schedules, called bidlines...

Upper bounds on the average distance \(\overline{l}\) between pairs of vertices of a connected graph with given order \(n\) and minimum degree `(\delta...

The transmission of a vertex in a connected graph is the sum of all distance from that vertex to the others. It is said to be normalized if divided by <i>n-1...

Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent ...

A polygon is said to be <i>simple</i> if the only points of the plane belonging to two of its edges are its vertices. We answer the question of finding, ...

With the help of the Graffiti system, Fajtlowicz conjectured around 1992 that the average distance between two vertices of a connected graph <i>G</i> is at ...

Methods, models, heuristic and exact algorithms for clustering are reviewed from a mathematical programming view point.

Horizontal cooperation among franchisees is now a well-known reality in franchising, as exemplified by the growing number of franchisee associations and adve...

Let <img src="/cgi-bin/mimetex.cgi?G=(V,E)"> be a simple, undirected graph of order <img src="/cgi-bin/mimetex.cgi?n"> and size <img src="/cgi-bin/mimetex.cg...