Issue |
RAIRO-Oper. Res.
Volume 47, Number 4, September-December 2013
ROADEF 2012
|
|
---|---|---|
Page(s) | 331 - 360 | |
DOI | https://doi.org/10.1051/ro/2013042 | |
Published online | 09 October 2013 |
Computing and proving with pivots
UniversitéParis Est, CERMICS (ENPC), 77455
Marne-la-Vallée,
France
frederic.meunier@enpc.fr
Received:
21
June
2013
Accepted:
1
July
2013
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.
Mathematics Subject Classification: 90C49 / 05E45
Key words: Combinatorial topology / complementarity problems / constructive proofs / pivoting algorithms
© EDP Sciences, ROADEF, SMAI, 2013
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.