3212 results — page 67 of 161

, , and

The past decade has seen advances in general methods for symmetry breaking in mixed-integer linear programming. These methods are advantageous for general ...

BibTeX reference

The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...

BibTeX reference
and

We consider a two-period closed-loop supply chain (CLSC) game where a remanufacturer appropriates of the returns' residual value and decides whether to exc...

BibTeX reference
, , and

In this paper, we provide a decomposition over time of Shapley value for dynamic stochastic discrete-time games, where the uncertainty is described by an eve...

BibTeX reference

Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...

BibTeX reference
, , and

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

BibTeX reference

Convex nondifferentiable, also known as convex nonsmooth, optimization (NDO) looks at problems where the functions involved are not continuously different...

BibTeX reference
, , , , and

This paper is concerned with computing global optimal solutions for maximum k-cut problems. We improve on the SBC algorithm of Ghaddar, Anjos and Liers in...

BibTeX reference
and

Shared-segment protection offers a good compromise between shared link and path protection. In this paper, we further investigate segment protection with res...

BibTeX reference
and

This work introduces the use of the treed Gaussian process (TGP) as a surrogate model within the mesh adaptive direct search (MADS) framework for constrain...

BibTeX reference

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

BibTeX reference
, , and

We study the optimisation of a biomass waste to energy conversion system using an adapted Tabu Search heuristic. It corresponds to a non-linear and non-conv...

BibTeX reference
and

Le secteur économique du transport aérien de passagers est soumis à de fortes contraintes dues aux nouveaux acteurs dans le domaine qui tendent les prix vers...

BibTeX reference
, , and

This paper presents a framework in which many structural credit risk models can be made hybrid by randomizing the default trigger, while keeping the capita...

BibTeX reference
, , and

We develop a flexible discrete-time hedging methodology that miminizes the expected value of any desired penalty function of the hedging error within a gener...

BibTeX reference
, , and

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

BibTeX reference
, , , and

Survivability in IP-over-WDM networks has already been extensively discussed in a series of studies. While many studies assume an IP restoration scheme and f...

BibTeX reference
and

The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...

BibTeX reference
and

We consider different statistical models for the call arrival process in telephone call centers. We evaluate the forecasting accuracy of those models by desc...

BibTeX reference
, , , and

In this paper, we propose new mathematical programming approaches for computing time-dependent bid prices in network revenue management problems. In contrast...

BibTeX reference