Displaying 21 – 40 of 44

Showing per page

Comparing Imperfection Ratio and Imperfection Index for Graph Classes

Arie M.C.A. Koster, Annegret K. Wagler (2009)

RAIRO - Operations Research

Perfect graphs constitute a well-studied graph class with a rich structure, reflected by many characterizations with respect to different concepts. Perfect graphs are, for instance, precisely those graphs G where the stable set polytope STAB(G) coincides with the fractional stable set polytope QSTAB(G). For all imperfect graphs G it holds that STAB(G) ⊂ QSTAB(G). It is, therefore, natural to use the difference between the two polytopes in order to decide how far an imperfect graph is away...

Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint

Hoai An Le Thi, Mohand Ouanes (2006)

RAIRO - Operations Research

The purpose of this paper is to demonstrate that, for globally minimize one dimensional nonconvex problems with both twice differentiable function and constraint, we can propose an efficient algorithm based on Branch and Bound techniques. The method is first displayed in the simple case with an interval constraint. The extension is displayed afterwards to the general case with an additional nonconvex twice differentiable constraint. A quadratic bounding function which is better than the well known...

Deterministic global optimization using interval constraint propagation techniques

Frederic Messine (2004)

RAIRO - Operations Research - Recherche Opérationnelle

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

Deterministic global optimization using interval constraint propagation techniques

Frederic Messine (2010)

RAIRO - Operations Research

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

Finding the principal points of a random variable

Emilio Carrizosa, E. Conde, A. Castaño, D. Romero-Morales (2001)

RAIRO - Operations Research - Recherche Opérationnelle

The p -principal points of a random variable X with finite second moment are those p points in minimizing the expected squared distance from X to the closest point. Although the determination of principal points involves in general the resolution of a multiextremal optimization problem, existing procedures in the literature provide just a local optimum. In this paper we show that standard Global Optimization techniques can be applied.

Finding the principal points of a random variable

Emilio Carrizosa, E. Conde, A. Castaño, D. Romero–Morales (2010)

RAIRO - Operations Research

The p-principal points of a random variable X with finite second moment are those p points in minimizing the expected squared distance from X to the closest point. Although the determination of principal points involves in general the resolution of a multiextremal optimization problem, existing procedures in the literature provide just a local optimum. In this paper we show that standard Global Optimization techniques can be applied.

Goffin's algorithm for zonotopes

Michal Černý (2012)

Kybernetika

The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor n (where n is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...

Integer programming approaches for minimum stabbing problems

Breno Piva, Cid C. de Souza, Yuri Frota, Luidi Simonetti (2014)

RAIRO - Operations Research - Recherche Opérationnelle

The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to...

Mathematical Optimization for the Train Timetabling Problem

Stanojević, Predrag, Marić, Miroslav, Kratica, Jozef, Bojović, Nebojša, Milenković, Miloš (2010)

Mathematica Balkanica New Series

AMS Subj. Classification: 90C57; 90C10;Rail transportation is very rich in terms of problems that can be modelled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem aims at...

On co-bicliques

Denis Cornaz (2007)

RAIRO - Operations Research

A co-biclique of a simple undirected graph G = (V,E) is the edge-set of two disjoint complete subgraphs of G. (A co-biclique is the complement of a biclique.) A subset F ⊆ E is an independent of G if there is a co-biclique B such that F ⊆ B, otherwise F is a dependent of G. This paper describes the minimal dependents of G. (A minimal dependent is a dependent C such that any proper subset of C is an independent.) It is showed that a minimum-cost dependent set of G can be determined in polynomial...

Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques

Hadda Cherroun, Alain Darte, Paul Feautrier (2007)

RAIRO - Operations Research

The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

Luis A.A. Meira, Flávio K. Miyazawa (2011)

RAIRO - Operations Research

In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain solutions for small and moderate sized instances, and the best heuristics obtained optimum or near optimum...

Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

Luis A.A. Meira, Flávio K. Miyazawa (2011)

RAIRO - Operations Research

In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain solutions for small and moderate sized instances, and the best heuristics obtained optimum or near optimum...

The adaptation of the k -means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm

Rudolf Scitovski, Kristian Sabo (2019)

Applications of Mathematics

We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse E is viewed as a Mahalanobis circle with center S , radius r , and some positive definite matrix Σ . A very efficient method for solving this problem is proposed. The method uses a modification of the k -means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers are determined...

Currently displaying 21 – 40 of 44