Notes on Bland’s pivoting rule

Mathematical Programming Studies - Polyhedral Combinatorics ◽

10.1007/bfb0121192 ◽

1978 ◽

pp. 24-34 ◽

Author(s):

D. Avis ◽

V. Chvátal

Keyword(s):

Download Full-text

A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games

Integer Programming and Combinatoral Optimization - Lecture Notes in Computer Science ◽

10.1007/978-3-642-20807-2_16 ◽

2011 ◽

pp. 192-206 ◽

Author(s):

Oliver Friedmann

Keyword(s):

Lower Bound ◽

Linear Programs ◽

Download Full-text

A novel iterative improvement pivoting rule for local search heuristics

Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO '17 ◽

10.1145/3067695.3082047 ◽

2017 ◽

Author(s):

Saad Bougrine ◽

Mohammed Amine El Majdouli ◽

Abdelhakim Ameur El Imrani

Keyword(s):

Local Search ◽

Local Search Heuristics ◽

Search Heuristics ◽

Iterative Improvement ◽

Download Full-text

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15 ◽

10.1145/2746539.2746557 ◽

2015 ◽

Author(s):

Thomas Dueholm Hansen ◽

Uri Zwick

Keyword(s):

Simplex Algorithm ◽

Download Full-text

ON NETWORK SIMPLEX METHOD USING THE PRIMAL-DUAL SYMMETRIC PIVOTING RULE

Journal of the Operations Research Society of Japan ◽

10.15807/jorsj.43.149 ◽

2000 ◽

Vol 43 (1) ◽

pp. 149-161 ◽

Author(s):

Masakazu Muramatsu

Keyword(s):

Simplex Method ◽

Primal Dual ◽

Pivoting Rule ◽

Network Simplex

Download Full-text

A Variant of the Dual Pivoting Rule in Linear Programming

Journal of Information and Optimization Sciences ◽

10.1080/02522667.1994.10699198 ◽

1994 ◽

Vol 15 (3) ◽

pp. 405-413 ◽

Author(s):

Ping-Qi Pan

Keyword(s):

Linear Programming ◽

Download Full-text

An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

Mathematical Programming ◽

10.1007/bf01585729 ◽

1990 ◽

Vol 46 (1-3) ◽

pp. 79-84 ◽

Author(s):

C. Roos

Keyword(s):

Simplex Method ◽

Download Full-text

Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks

Annals of Operations Research ◽

10.1007/s10479-012-1199-x ◽

2012 ◽

Vol 201 (1) ◽

pp. 159-167 ◽

Author(s):

Guy Even ◽

Alexander Zadorojniy

Keyword(s):

Random Walks ◽

Pivoting Rule ◽

Controlled Random Walks ◽

Strong Polynomiality

Download Full-text

A PIVOTING RULE THAT REDUCES TOTAL INFEASIBILITY FOR LINEAR PROGRAMMING

Journal of International Management Studies ◽

10.18374/jims-13-4.7 ◽

2013 ◽

Vol 13 (4) ◽

pp. 61-68

Author(s):

Xinjian Lu

Keyword(s):

Linear Programming ◽

Download Full-text

Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973402.63 ◽

2013 ◽

Author(s):

Thomas Dueholm Hansen ◽

Haim Kaplan ◽

Uri Zwick

Keyword(s):

Shortest Paths ◽

Minimum Cost ◽

Download Full-text

A note on the Edmonds-Fukuda pivoting rule for simplex algorithms

European Journal of Operational Research ◽

10.1016/0377-2217(87)90251-7 ◽

1987 ◽

Vol 29 (3) ◽

pp. 378-383 ◽

Author(s):

Jens Clausen

Keyword(s):

Download Full-text