Solving optimization problems with unknown parameters often requires learning a predictive
model to predict the values of the unknown parameters and then solving the problem using …

We consider the facility location problem with submodular penalties (FLPSP) and the facility
location problem with linear penalties (FLPLP), two extensions of the classical facility …

In this paper, we consider the k-prize-collecting minimum vertex cover problem with
submodular penalties, which generalizes the well-known minimum vertex cover problem …

In this paper, we consider multiprocessor scheduling with submodular penalties to extend
multiprocessor scheduling with rejection to submodular function. An instance of the problem …

In this paper, we study a logistics network design problem with vendor managed inventory in
which the company is in charge of managing inventory for its downstream warehouses and …

The combined simulated annealing (CSA) algorithm was developed for the discrete facility
location problem (DFLP) in the paper. The method is a two‐layer algorithm, in which the …

In this paper, we introduce the submodular multicut problem in trees with submodular
penalties, which generalizes the prize-collecting multicut problem in trees and the …

In this paper, we consider the single machine scheduling problem with release dates and
nonmonotone submodular rejection penalty. We are given a single machine and multiple …

The notion of penalty has been introduced into many combinatorial optimization models. In
this paper, we consider the submodular vertex cover problems with linear and submodular …

Submodular functions and variants, through their ability to characterize diversity and
coverage, have emerged as a key tool for data selection and summarization. Many recent …