RAIRO - Operations Research - Recherche Opérationnelle, Volume 47 (2013) no. 3

Table of contents

Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic

Laforest, Christian; Phan, Raksmey

p. 199-221

How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

Touati, Sid-Ahmed-Ali; Briais, Sébastien; Deschinkel, Karine

p. 223-249

Repeated games with asymmetric information modeling financial markets with two risky assets

Kreps, Victoria; Domansky, Victor

p. 251-272

Production planning in data envelopment analysis without explicit inputs

Amirteimoori, Alireza; Daneshian, Behrooz; Kordrostami, Sohrab; Shahroodi, Kambiz

p. 273-284

New results on semidefinite bounds for

ℓ_{1}

-constrained nonconvex quadratic optimization

Xia, Yong

p. 285-297

From Eckart and Young approximation to Moreau envelopes and vice versa

Hiriart-Urruty, Jean-Baptiste; Le, Hai Yen

p. 299-310

Producing the tangency portfolio as a corner portfolio

Keykhaei, Reza; Jahandideh, Mohamad-Taghi

p. 311-320

Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view

Torres, Luis M.; Wagler, Annegret K.

p. 321-330