Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in… Expand

Is this relevant?

2012

2012

Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of… Expand

Is this relevant?

2011

2011

Very Large-Scale Neighborhood (VLSN) search is the idea of using neighborhoods of exponential size to find high-quality solutions… Expand

Is this relevant?

Review

2011

Review

2011

Many optimization problems that model the essential issues of important real-world decision making are computationally… Expand

Is this relevant?

2011

2011

Very large-scale neighborhood search (VLSNS) is a technique intensively used in single-objective optimization. However, there is… Expand

Is this relevant?

2007

2007

The quadratic assignment problem (QAP) consists of assigning n facilities to n locations to minimize the total weighted cost of… Expand

Is this relevant?

2007

2007

Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult… Expand

Is this relevant?

2004

2004

A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We propose a metaheuristic algorithm for the multi-resource generalized assignment problem (MRGAP). MRGAP is a generalization of… Expand

Is this relevant?

Review

2002

Review

2002

Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving… Expand

Is this relevant?