Citation Impact
Citing Papers
Fast and versatile sequence-independent protein docking for nanomaterials design using RPXDock
2023 StandoutNobel
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
2009 Standout
Real-time cryo-electron microscopy data preprocessing with Warp
2019 Standout
What energy functions can be minimized via graph cuts?
2004 Standout
Automated determination of parameters describing power spectra of micrograph images in electron microscopy
2003
Robust Face Recognition via Sparse Representation
2009 Standout
Sparse MRI: The application of compressed sensing for rapid MR imaging
2007 Standout
CTFFIND4: Fast and accurate defocus estimation from electron micrographs
2015 Standout
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
2006 Standout
The Adaptive Lasso and Its Oracle Properties
2006 Standout
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
2007 Standout
Future paths for integer programming and links to artificial intelligence
1986 Standout
Internet of Things (IoT): A vision, architectural elements, and future directions
2013 Standout
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
2004 Standout
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
1999 Standout
Regularization Paths for Generalized Linear Models via Coordinate Descent.
2010 Standout
Traveling salesman problem heuristics: Leading methods, implementations and latest advances
2010
Multiple centrality corrections in a primal-dual method for linear programming
1996
Distance Realization Problems with Applications to Internet Tomography
2001
Atomic Decomposition by Basis Pursuit
2001 Standout
The no-surplus condition as a characterization of perfectly competitive equilibrium
1980
Dynamic vehicle routing problems: Three decades and counting
2015
Community detection in graphs
2009 Standout
Interior methods for constrained optimization
1992
On games without side payments arising from a general class of markets
1974
Clustering by Passing Messages Between Data Points
2007 StandoutScience
A tutorial on support vector regression
2004 Standout
Data clustering
1999 Standout
Julia: A Fresh Approach to Numerical Computing
2017 Standout
Finding an interior point in the optimal face of linear programs
1993
Competitive outcomes in the cores of market games
1975 StandoutNobel
Compressed sensing
2006 Standout
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
2000
Zero‐one quadratic programming algorithm for resource leveling of manufacturing process schedules
1995
Chemical-Reaction-Inspired Metaheuristic for Optimization
2009 Standout
Layering strategies for creating exploitable structure in linear and integer programs
1988
Monopolistic Competition in a Large Economy with Differentiated Commodities
1979 StandoutNobel
Robust principal component analysis?
2011 Standout
Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm
2015 Standout
HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method
1995
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
2010 Standout
Laboratory Experimentation in Economics: A Methodological Overview
1988 StandoutNobel
Regression Shrinkage and Selection via The Lasso: A Retrospective
2011 Standout
Violations of Local Realism by Two EntangledN
2000 StandoutNobel
Accessing From the Sky: A Tutorial on UAV Communications for 5G and Beyond
2019 Standout
The vehicle routing problem: State of the art classification and review
2015 Standout
Self-scheduling of electric vehicles in an intelligent parking lot using stochastic optimization
2014
Stable signal recovery from incomplete and inaccurate measurements
2006 Standout
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
2006 Standout
The interior-point revolution in optimization: History, recent developments, and lasting consequences
2004
Branch-and-Price: Column Generation for Solving Huge Integer Programs
1998 Standout
A combinatorial strongly polynomial algorithm for minimizing submodular functions
2001
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
2016
An Introduction To Compressive Sampling
2008 Standout
Extracting embedded generalized networks from linear programming problems
1985
Atomic Decomposition by Basis Pursuit
1998 Standout
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
2006 Standout
Ship Routing and Scheduling: Status and Perspectives
2004 Standout
Mathematical Programming in Data Mining
1997
Resource-constrained project scheduling: Notation, classification, models, and methods
1999 Standout
Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)
2018 Standout
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
2003 Standout
An efficient k-means clustering algorithm: analysis and implementation
2002 Standout
Computing in Operations Research Using Julia
2015
Axiomatic bargaining theory on economic environments
1988
Coverage and connectivity issues in wireless sensor networks: A survey
2008
Decoding by Linear Programming
2005 Standout
A review on the state-of-the-art technologies of electric vehicle, its impacts and prospects
2015 Standout
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
2006 Standout
A Constant-Factor Approximation Algorithm for the k-Median Problem
2002
2015 Standout
Supersparse linear integer models for optimized medical scoring systems
2015
Greed is Good: Algorithmic Results for Sparse Approximation
2004 Standout
Convex Optimization
2004 Standout
Iterated Local Search
2001
Works of Robert E. Bixby being referenced
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
2007
Market representations of $n$-person games
1974
A characterization of Pareto surfaces
1973
The Partial Order of a Polymatroid Extreme Point
1985
Converting Linear Programs to Network Problems
1980
Finding Tours in the TSP
1999
Integer Programming and Combinatorial Optimization
1998
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
2003
Progress in computational mixed integer programming—A look back from the other side of the tipping point
2007
MIPLIB 2010
2011
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
1992
An Almost Linear-Time Algorithm for Graph Realization
1988
Commentary—Progress in Linear Programming
1994
Pareto Surfaces of Complexity 1
1976
Solving Real-World Linear Programs: A Decade and More of Progress
2002
Implementing the Simplex Method: The Initial Basis
1992
A characterization of polyhedral market games
1973