3083 results — page 78 of 155

and

Top-tier customers - that is, those 20% of customers that typically bring in 80% of all profits - are extremely valuable to companies. In the many instances ...

BibTeX reference
and

We consider filter design of a linear system with parameter uncertainty. In contrast to the robust Kalman filter which focuses on a worst case analysis, we p...

BibTeX reference
, , and

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

BibTeX reference
, , and

Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performan...

BibTeX reference
, , , and

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...

BibTeX reference

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

BibTeX reference
and

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...

BibTeX reference
, , and

The multi-agent resource allocation problem corresponds to the negotiation of <i>m</i> resources among <i>n</i> autonomous agents, in order to maximize a soc...

BibTeX reference
, , , , , and

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...

BibTeX reference

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...

BibTeX reference
, , , and

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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...

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference
and

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...

BibTeX reference
, , and

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

BibTeX reference

Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of <i>n</i> points into <i>k</i> clusters in order to minimize the sum of squar...

BibTeX reference

In this paper we use a dynamic model to analyze the composition and stability of international environmental agreements (IEAs) in an asymmetrical framework. ...

BibTeX reference