3237 results — page 59 of 162

and

Aircraft sizing, route network design, demand estimation and allocation of aircraft to routes are different facets of the air transportation optimization pro...

BibTeX reference
and

This paper provides new results on the application of semidefinite optimization to satisfiability by studying the connection between semidefinite optimizatio...

BibTeX reference
, , and

This paper discusses a unique formulation of en-route flight planning problem in a constrained airspace with the objective of minimizing the total cost while...

BibTeX reference
, , and

We consider the multivariate linear model for multilevel data where units are nested within a hierarchy of clusters. We propose permutation procedures to tes...

BibTeX reference
and

We introduce an efficient approach to evaluate counterparty risk and compute the Credit Value Adjustement for derivatives having early exercise features. The...

BibTeX reference
, , , and

In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

BibTeX reference
, , and

Increase of bandwidth demand in data networks, driven by the continuous growth of the Internet and the increase of bandwidth greedy applications, raise the i...

BibTeX reference
, , and

We present a matheuristic, an integer programming based heuristic, for the liner shipping network design problem. This problem consists of finding a set of...

BibTeX reference
, , and

We study call routing policies for call centers with multiple call types and multiple agent groups. We introduce new weight-based routing policies where each...

BibTeX reference
, , and

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

BibTeX reference
, , and

The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color clas...

BibTeX reference

We show here that every \(m\)-dimensional semiring module \(M\) over an idempotent semiring \(S\) with strongly independent basis can be embedded in...

BibTeX reference

This paper presents a new method for solving the short-term unit commitment and loading problem of a hydropower system. Dynamic programming is used to comput...

BibTeX reference

Air-conflict resolution is a bottleneck of air traffic management that will soon require powerful decision-aid systems to avoid the proliferation of delays....

BibTeX reference
, , and

The inventory-routing problem (IRP) integrates two well-studied problems, namely, inventory management and vehicle routing. Given a set of customers to servi...

BibTeX reference
and

In many applications, such as metabolomics, data are composed of several continuous measurements of subjects (tissues) over multiple variables (metabolites)....

BibTeX reference
, , , , , , and

Constrained blackbox optimization is a difficult problem, with most approaches coming from the mathematical programming literature. The statistical literatur...

BibTeX reference

Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer ...

BibTeX reference

A preconditioned variant of the Golub and Kahan (1965) bidiagonalization process recently proposed by Arioli (2013) and Arioli and Orban (2013) allows us to ...

BibTeX reference
, , , and

In this article, we propose a general framework for an algorithm derived from the primal simplex that guarantees a strict improvement in the objective after ...

BibTeX reference