Displaying similar documents to “Minmax regret combinatorial optimization problems: an Algorithmic Perspective”

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan (2011)

RAIRO - Operations Research

Similarity:

Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, , where uncertainty...

Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem

Jacek Blazewicz, Marta Kasprzak (2006)

RAIRO - Operations Research

Similarity:

In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O(log)-time algorithm is given, where is a...

Une heuristique d'optimisation globale basée sur la -transformation

Alexandre Dolgui, Valery Sysoev (2010)

RAIRO - Operations Research

Similarity:

In this paper, we study a heuristic algorithm for global optimization, which is based on the -transformation. We illustrate its behavior first, on a set of continuous non-convex objective functions – we search the global optimum of each function. Then, we give an example from combinatorial optimization. It concerns the optimization of scheduling rules parameters of a manufacturing system. Computational results are presented, they look encouraging.

Design-dependent loads in topology optimization

Blaise Bourdin, Antonin Chambolle (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We present, analyze, and implement a new method for the design of the stiffest structure subject to a pressure load or a given field of internal forces. Our structure is represented as a subset  of a reference domain, and the complement of is made of two other “phases”, the “void” and a fictitious “liquid” that exerts a pressure force on its interface with the solid structure. The problem we consider is to minimize the compliance of the structure , which is the total work of...

Three tabu search methods for the MI-FAP applied to 802.11 networks

Sacha Varone, Nicolas Zufferey (2009)

RAIRO - Operations Research

Similarity:

Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually....