A benchmarking suite describing over 1000 optimization problems and constraint satisfaction problems covering problems from different traditions is described, annotated with best known solutions, and accompanied by recommended benchmarking protocols for comparing test results.

The goal of this research is to provide practical solutions for covering problems. Covering problems arise in a variety of practical settings such as manufacturing, telecommunications, spatial query optimization, publish/subscribe middleware, graphics, molecular modeling, medical treatment and mobile military sensor coverage and targeting. For example, in the mobile sensor case a region is asso...

in this study, under the constraint of resource-saving and environment-friendliness objective, based on multi-agent genetic algorithm, multi-objective spatial optimization (moso) model for land use allocation was developed from the view of simulating the biological autonomous adaptability to environment and the competitive-cooperative relationship. the model was applied to solve the practical m...

In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set S of feasible integer points, such as popular linear programming or semi-definite programming hierarchies. On the other hand, various method...

Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this paper we focus on the problem of aggregating interval orders which are special preference structures allowing the introduction of tresholds for the indifference relation. We propose to solve this problem by first transl...

We investigate a new optimization problem involving minimizing the Ratio of two Submodular (RS) functions. We argue that this problem occurs naturally in several real world applications. We then show the connection between this problem and several related problems including minimizing the difference between submodular functions (Iyer & Bilmes, 2012b; Narasimhan & Bilmes, 2005), and to submodula...