Citation Impact
Citing Papers
Fast and versatile sequence-independent protein docking for nanomaterials design using RPXDock
2023 StandoutNobel
A Note on Formulations of Static and Dynamic Berth Allocation Problems
2003
Sustainable biochar to mitigate global climate change
2010 Standout
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
Ant system: optimization by a colony of cooperating agents
1996 Standout
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
2005 Standout
Jacobian-free Newton–Krylov methods: a survey of approaches and applications
2003 Standout
Machine learning: Trends, perspectives, and prospects
2015 StandoutScience
Future paths for integer programming and links to artificial intelligence
1986 Standout
Theoretical comparisons of search strategies in branch-and-bound algorithms
1976
Optimization for Machine Learning
2011
A survey of sparse matrix research
1977
A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing
2015 Standout
Modelling the absolute returns of different stock indices: exploring the forecastability of an alternative measure of risk
2000 StandoutNobel
Minimum cost routing for static network models
1971
Optimal allocation of turns to lanes at an isolated signal-controlled junction
2010 Standout
A sparse signal reconstruction perspective for source localization with sensor arrays
2005 Standout
An O(n 3 L) potential reduction algorithm for linear programming
1991
The university of Florida sparse matrix collection
2011 Standout
A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
2014 Standout
Semantic Association Identification and Knowledge Discovery for National Security Applications
2005
A gentle introduction to quantile regression for ecologists
2003 Standout
Dynamic strategies for branch and bound
1976
Atomic Decomposition by Basis Pursuit
2001 Standout
A column generation and partitioning approach for multi-commodity flow problems
1994
Locational analysis
1983
Interior methods for constrained optimization
1992
Hospital Layout as a Quadratic Assignment Problem
1977
A generalized upper bounding approach to a communications network planning problem
1977
A tutorial on support vector regression
2004 Standout
Semidefinite Programming
1996 Standout
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
2002 Standout
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
2005 Standout
A survey of berth allocation and quay crane scheduling problems in container terminals
2009 Standout
A polyhedral branch-and-cut approach to global optimization
2005 Standout
A fuzzy approach to select the location of the distribution center
2001 Standout
On building minimum cost communication networks
1973
Analysis and design of communication networks with memory
1969
An implementation of the simplex method for linear programming problems with variable upper bounds
1982
Multicommodity network flows—A survey
1978
Interior-point methods for optimization
2008
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
1986
Strategic facility location: A review
1998 Standout
Facility location models for distribution planning
1985
Survey of graph database models
2008 Standout
Recent Advances in Crew-Pairing Optimization at American Airlines
1991
UK road freight energy use by product: trends and analysis from 1985 to 1995
1999
The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators
1997
Interior Methods for Nonlinear Optimization
2002
Maintaining LU factors of a general sparse matrix
1987
Staff scheduling and rostering: A review of applications, methods and models
2003 Standout
Numerical solution of saddle point problems
2005 Standout
The Nature of Computation
2011
Preconditioners for Indefinite Systems Arising in Optimization
1992
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
1992
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
1981
Network Design and Transportation Planning: Models and Algorithms
1984 Standout
Elements of Large Scale Mathematical Programming Part II: Synthesis of Algorithms and Bibliography
1970
Sparse Matrix Methods in Optimization
1984
A Survey of Optimization Models for Train Routing and Scheduling
1998 Standout
Reoptimization procedures for bounded variable primal simplex network algorithms
1986
A calculus for network delay. I. Network elements in isolation
1991 Standout
Transport network optimization in the Dutch integral transportation study
1974
Validation of subgradient optimization
1974 Standout
Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem
2012 Standout
Solving staircase linear programs by the simplex method, 1: Inversion
1982
Nonlinear Optimization by Successive Linear Programming
1982
Multiobjective output-feedback control via LMI optimization
1997 Standout
Updating the Inverse of a Matrix
1989 Standout
On building minimum cost communication networks over time
1974
Robust constrained model predictive control using linear matrix inequalities
1996 Standout
Computational results of an interior point algorithm for large scale linear programming
1991
Greedy Randomized Adaptive Search Procedures
1995 Standout
The interior-point revolution in optimization: History, recent developments, and lasting consequences
2004
A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
1982
Branch-and-Price: Column Generation for Solving Huge Integer Programs
1998 Standout
Solving symmetric indefinite systems in an interior-point method for linear programming
1993
Asymptotics for lasso-type estimators
2000 Standout
Fibonacci heaps and their uses in improved network optimization algorithms
1987 Standout
Applications of second-order cone programming
1998 Standout
Atomic Decomposition by Basis Pursuit
1998 Standout
<title>Block coordinate relaxation methods for nonparamatric signal denoising</title>
1998
An interior point algorithm for nonlinear quantile regression
1996
Soil Organic Carbon Sequestration Rates by Tillage and Crop Rotation
2002 Standout
Linear Programming: Foundations and Extensions
1998
A stochastic programming approach for supply chain network design under uncertainty
2004 Standout
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
2003 Standout
Continuation and path following
1993
An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
1996
A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
1990
A primal-dual interior-point method for robust optimal control of linear discrete-time systems
2000
Subgradient Methods for the Service Network Design Problem
1994
Introduction to the IBM Optimization Subroutine Library
1992
Robust and Secure Wireless Communications via Intelligent Reflecting Surfaces
2020 Standout
Path-Following Methods for Linear Programming
1992
Numerical Linear Algebra and Optimization
2021
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
2016 Standout
Quantile Regression
2001 Standout
The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community
2003 Standout
A primal—dual potential reduction method for problems involving matrix inequalities
1995
Constructive Duality in Integer Programming
1974
Survey of decentralized control methods for large scale systems
1978 Standout
Convex Optimization
2004 Standout
Works of John A. Tomlin being referenced
Practical Solution of Large Mixed Integer Programming Problems with Umpire
1974
A case for automated large-scale semantic annotation
2003
A Mathematical Programming Model for the Combined Distribution-Assignment of Traffic
1971
Mathematical programming models for traffic network problems
1967
Minimum-Cost Multicommodity Network Flows
1966
Large scale mathematical programming systems
1983
Technical Note—An Improved Branch-and-Bound Method for Integer Programming
1971
Vector processing in simplex and interior methods for linear programming
1990
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
1986
Maintaining a Sparse Inverse in the Simplex Method
1972
Fuel consumption and emission modelling by power demand and a comparison with other models
1984
Updated triangular factors of the basis to maintain sparsity in the product form simplex method
1972
An integer programming approach to a class of combinatorial problems
1972
Implementing the simplex method for the Optimization Subroutine Library
1992
Pivoting for Size and Sparsity in Linear Programming Inversion Routes
1972
Implementing interior point linear programming methods in the Optimization Subroutine Library
1992