Geodesic
Computing and proving with pivots
RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 331-360

Voir la notice de l'article provenant de la source Numdam

A simple idea used in many combinatorial algorithms is the idea of pivoting. Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset σ to a new one σ′ by deleting an element inside σ and adding an element outside σ: σ′ = σ\ { v}  ∪  {u}, with v ∈ σ and u ∉ σ. This simple principle combined with other ideas appears to be quite powerful for many problems. This present paper is a survey on algorithms in operations research and discrete mathematics using pivots. We give also examples where this principle allows not only to compute but also to prove some theorems in a constructive way. A formalisation is described, mainly based on ideas by Michael J. Todd.

DOI : 10.1051/ro/2013042
Classification : 90C49, 05E45
Keywords: combinatorial topology, complementarity problems, constructive proofs, pivoting algorithms 
@article{RO_2013__47_4_331_0,
     author = {Meunier, Fr\'ed\'eric},
     title = {Computing and proving with pivots},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {331--360},
     publisher = {EDP-Sciences},
     volume = {47},
     number = {4},
     year = {2013},
     doi = {10.1051/ro/2013042},
     mrnumber = {3143757},
     zbl = {1286.90167},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2013042/}
}
TY  - JOUR
AU  - Meunier, Frédéric
TI  - Computing and proving with pivots
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2013
SP  - 331
EP  - 360
VL  - 47
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2013042/
DO  - 10.1051/ro/2013042
LA  - en
ID  - RO_2013__47_4_331_0
ER  - 
%0 Journal Article
%A Meunier, Frédéric
%T Computing and proving with pivots
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2013
%P 331-360
%V 47
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2013042/
%R 10.1051/ro/2013042
%G en
%F RO_2013__47_4_331_0
Meunier, Frédéric. Computing and proving with pivots. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 331-360. doi: 10.1051/ro/2013042

Cité par Sources :