24 papers:
STOC-2015-FearnleyS #complexity- The Complexity of the Simplex Method (JF, RS), pp. 201–208.
- STOC-2015-HansenZ #algorithm
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (TDH, UZ), pp. 209–218.
- STOC-2015-Nikolov #problem #random
- Randomized Rounding for the Largest Simplex Problem (AN), pp. 861–870.
ICPR-2014-BlondelFU #multi #scalability- Large-Scale Multiclass Support Vector Machine Training via Euclidean Projection onto the Simplex (MB, AF, NU), pp. 1289–1294.
- STOC-2013-BuchbinderNS #clustering #exponential #multi #problem
- Simplex partitioning via exponential clocks and the multiway cut problem (NB, JN, RS), pp. 535–544.
ICML-c2-2013-KyrillidisBCK- Sparse projections onto the simplex (ATK, SB, VC, CK), pp. 235–243.
FM-2012-SpasicM #algorithm #formal method #incremental #refinement- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (MS, FM), pp. 434–449.
CAV-2012-HanJ #satisfiability- When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way (CSH, JHRJ), pp. 410–426.
IJCAR-2012-BobotCCIMMM #integer #linear- A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic (FB, SC, EC, MI, AM, AM, GM), pp. 67–81.
- STOC-2011-FriedmannHZ #algorithm #bound #random
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
CIKM-2010-ThurauKB #matrix- Yes we can: simplex volume maximization for descriptive web-scale matrix factorization (CT, KK, CB), pp. 1785–1788.
- ICPR-2008-SteinbisVH
- New extensions of the 3-simplex for exterior orientation (JMS, TV, WAH), pp. 1–5.
- STOC-2006-KelnerS #algorithm #linear #polynomial #programming #random
- A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
SOFTVIS-2006-BaloukasP #algorithm #network #visualisation- A visualization software for the network simplex algorithm (TB, KP), pp. 153–154.
- ICPR-v4-2004-LinWH #monte carlo
- Articulate Hand Motion Capturing Based on a Monte Carlo Nelder-Mead Simplex Tracker (JL, YW, TSH), pp. 975–978.
ITiCSE-2003-PapamanthouP #algorithm #problem #visualisation- A visualization of the primal simplex algorithm for the assignment problem (CP, KP), p. 267.
- STOC-2001-SpielmanT #algorithm #analysis #polynomial #why
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (DAS, SHT), pp. 296–305.
ALP-PLILP-1998-Refalo #detection #incremental- Approaches to the Incremental Detection of Implicit Equalities with the Revised Simplex Method (PR), pp. 481–496.
- ICPR-1996-ChaoN #3d #performance
- Cubical singular simplex model for 3D objects and fast computation of homology groups (JC, JN), pp. 190–194.
- STOC-1995-AmatoGR
- Computing faces in segment and simplex arrangements (Preliminary Version) (NMA, MTG, EAR), pp. 672–682.
- STOC-1992-Kalai #algorithm #random
- A Subexponential Randomized Simplex Algorithm (Extended Abstract) (GK), pp. 475–482.
ICALP-1992-ChazelleR #bound #complexity #pointer- Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine (BC, BR), pp. 439–449.
- PLILP-1990-Jaakola #algorithm #constraints #theorem proving
- Modifying the Simplex Algorithm to a Constraint Solver (JJ), pp. 89–105.
- STOC-1984-AdlerM #algorithm #bound #polynomial
- A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension (IA, NM), pp. 312–323.
