2934 results — page 17 of 147

In the recent years, the development of new algorithms for multiobjective optimization has considerably grown. A large number of performance indicators has...

BibTeX reference

A hyper-heuristic refers to a search method or a learning mechanism for selecting or generating heuristics to solve computational search problems. Operat...

BibTeX reference
, , and

In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...

BibTeX reference

In this paper we tackle the problem of eNodeB failure detection in LTE networks using Binary Classification techniques under smart-cities Machine-to-Machine ...

BibTeX reference
and

In this paper, we study the problem of responsibility sharing for product recovery, and its relation to the design of Extended Producer Responsibility (EPR) ...

BibTeX reference

The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating...

BibTeX reference
, , , 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

The primal adjacency-based algorithm and the multi-directional dynamic programming algorithm are two exact methods that have recently been developed to effic...

BibTeX reference

A new solution approach is developed herein to address the topic of multi-product open-pit mine production scheduling with multi-element uncertainty. The m...

BibTeX reference
, , , and

This paper addresses the problem of distributing uniformly infrared radiative energy intercepted by a thermoplastic sheet surface during the infrared radiati...

BibTeX reference
, , and

Genetic algorithms are used for feature selection through a fitness function that drives the evolution of populations. With parallel universes, an importance...

BibTeX reference
, , , and

The eccentric connectivity index of a connected graph \(G\) is the sum over all vertices \(v\) of the product \(d_G(v)e_G(v)\), where \(d_G(v)\) is ...

BibTeX reference
, , , , and

We study an integrated process configuration, lot-sizing, and scheduling problem, which appears in a real production environment in the packaging industry. P...

BibTeX reference
, , and

In this paper, we consider non-stationary response variables and covariates, where the marginal distributions and the associated copula may be time-dependent...

BibTeX reference
, , , and

We extend a quasi-Monte Carlo scheme designed for coagulation to the simulation of the coagulation-fragmentation equation. A number \(N\) of particles is ...

BibTeX reference
, , , , and

The eccentricity of a vertex \(v\) in a graph \(G\) is the maximum distance between \(v\) and any other vertex of \(G\). The diameter of a graph `(...

BibTeX reference
and

A graceful difference labeling (gdl for short) of a directed graph \(G\) with vertex set \(V\) is a bijection `(f:V\rightarrow{1,\ldots,\vert V\vert}...

BibTeX reference
and

Given a directed graph \(G=(V,A)\), capacity and cost functions on \(A\), a root \(r\), a subset \(T \subset V\) of terminals, and an integer \(k\)...

BibTeX reference
, , and

In this paper, we consider a two-species fishery model where the species can have different biological interactions, namely, competitive, symbiotic or prey...

BibTeX reference
, , and

There has been a lot of interest recently on the energy efficiency and environmental impact of wireless networks. Given that the base stations are the netw...

BibTeX reference