Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11750-013-0291-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978428710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Klee–Minty random edge chain moves with linear speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving convex programs by random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sub-determinants and the diameter of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the diameter of the transportation polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for linear systems having a binary solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of transportation polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The central curve in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the curvature of the central path of linear programming theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes and arrangements: diameter and curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Policy Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criss-cross methods: A fresh view on pivot algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two New Bounds for the Random‐Edge Simplex‐Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the non-polynomiality of the relaxation method for systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Algorithm in Dimension Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Klee-Minty's LP and upper bounds for Dantzig's simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for a subexponential optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random edge can be exponential on abstract cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized pivot algorithms for \(P\)-matrix linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Hirsch conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of following the central path of linear programs by linear extrapolation. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relaxation methods for systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465119 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:18, 7 July 2024

scientific article; zbMATH DE number 6234078
Language Label Description Also known as
English
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
scientific article; zbMATH DE number 6234078

    Statements

    Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (English)
    0 references
    0 references
    0 references
    28 November 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references