The types of constraints encountered in black-box simulation-based optimization problems
differ significantly from those addressed in nonlinear programming. We introduce a …

Given an undirected graph with two different nonnegative costs associated with every edge
e (say, we for the weight and le for the length of edge e) and a budget L, consider the …

An extensive search of journal publications on heuristic methods and applications produced
442 articles published in 37 journals during the last sixteen years. A scheme is employed to …

In this paper we study multi-criteria routing problems related to Electric Vehicles (EVs).
Because EVs still suffer from a rather small cruising range restricted by the battery's capacity …

Knapsack problem and its generalizations have been intensively studied during the last
three decades with a rich literature of research reports. Over the years, surveys and reviews …

Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐
stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to …

We consider the problem of computing shortest paths subject to an additional resource
constraint such as a hard limit on the (positive) height difference of the path. This is typically …

Many polynomial-time solvable combinatorial optimization problems become NP-hard if an
additional complicating constraint is added to restrict the set of feasible solutions. In this …

A natural way to deal with multiple, partially conflicting objectives is turning all the objectives
but one into budget constraints. Many classical optimization problems, such as maximum …

During the last decades, a host of efficient algorithms have been developed for solving the
minimum spanning tree problem in deterministic graphs, where the weight associated with …