Standout Papers
Citation Impact
Citing Papers
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
2017 Standout
Use of the zero norm with linear models and kernel methods
2003
An Augmented Lagrangian Approach to Constrained MAP Inference
2011
The effect of COVID certificates on vaccine uptake, health outcomes, and the economy
2022 StandoutNobel
Efficient computation of three-dimensional protein structures in solution from nuclear magnetic resonance data using the program DIANA and the supporting programs CALIBA, HABAS and GLOMSA
1991 StandoutNobel
On the convergence of the decomposition method for support vector machines
2001
Duality for nonlinear fractional programs
1973
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
2007 Standout
A Simplified Model for Portfolio Analysis
1963 StandoutNobel
Future paths for integer programming and links to artificial intelligence
1986 Standout
Capital Budgeting of Interrelated Projects: Survey and Synthesis
1966
Restart procedures for the conjugate gradient method
1977 Standout
A method for registration of 3-D shapes
1992 Standout
The Slacked Unconstrained Minimization Technique for Convex Programming
1967
Maximum Likelihood and Bayesian Estimation of Transition Probabilities
1968
A Linear Programming Algorithm for Mutual Fund Portfolio Selection
1967 StandoutNobel
Theory of algorithms for unconstrained optimization
1992
A column generation and partitioning approach for multi-commodity flow problems
1994
Stopping criteria for linesearch methods without derivatives
1984
Community detection in graphs
2009 Standout
Generalized inverse methods for the best least squares solution of systems of non-linear equations
1968
Set Partitioning: A survey
1976
An augmented Lagrangian decomposition method for block diagonal linear programming problems
1989
A tutorial on support vector regression
2004 Standout
THE PERFORMANCE OF MUTUAL FUNDS IN THE PERIOD 1945–1964
1968 Standout
Multiperiod Consumption-Investment Decisions
1975 StandoutNobel
The decomposition principle for linear programs
1964
Acceptable points in games of perfect information
1960 StandoutNobel
Data clustering
1999 Standout
Nonlinear total variation based noise removal algorithms
1992 Standout
State Capacity and Economic Development: A Network Approach
2015 StandoutNobel
Computation of optimal controls
1966 StandoutNobel
An exact algorithm for IP column generation
1996
Trypsinogen-trypsin transition: a molecular dynamics study of induced conformational change in the activation domain
1987 StandoutNobel
A lattice-theoretical fixpoint theorem and its applications
1955
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
1960
Investment Analysis Under Uncertainty
1969 StandoutNobel
Trafficking Networks and the Mexican Drug War
2015
Analysis of neutron distance data
1981 StandoutNobel
LIBSVM
2011 Standout
Layering strategies for creating exploitable structure in linear and integer programs
1988
Cluster Analysis: An Application of Lagrangian Relaxation
1979
RISK, RETURN AND EQUILIBRIUM: SOME CLARIFYING COMMENTS
1968 StandoutNobel
Optimization with Disjunctive Constraints
1980
Direct search methods: then and now
2000
The Economist's Approach to Pollution and Its Control
1971 StandoutScienceNobel
WIEN2k: An APW+lo program for calculating the properties of solids
2020 Standout
Estimation and Inference for Linear Models in Which Subsets of the Dependent Variable are Constrained
1968 StandoutNobel
A Linear Programming Approach to the Cutting-Stock Problem
1961 Standout
On Estimating the Transition Probabilities of a Markov Process
1965
Portfolio Analysis in a Stable Paretian Market
1965 StandoutNobel
Reoptimization procedures for bounded variable primal simplex network algorithms
1986
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
2010 Standout
The density functional formalism, its applications and prospects
1989 Standout
Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
1955
Two-Way Fixed Effects Estimators with Heterogeneous Treatment Effects
2020 Standout
Primal partition programming for block diagonal matrices
1964
Iterative Methods for Optimization
1999
The Cutting-Plane Method for Solving Convex Programs
1960 Standout
Parameter-free convex equivalent and dual programs of fractional programming problems
1974
Measuring the efficiency of decision making units
1978 Standout
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
1969 Standout
Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems
2007 Standout
A Survey of Deep Active Learning
2021 Standout
New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
2002
Computational complexity of the ground-state determination of atomic clusters
1985
Hierarchical Decomposition in Linear Economic Models
1975 StandoutNobel
Non-Linear Regression with Minimal Assumptions
1962
Solving embedded generalized network problems
1985
Optimal Taxing for the Abatement of Water Pollution
1970
Branch-and-Price: Column Generation for Solving Huge Integer Programs
1998 Standout
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
1982
Interactive decision software and computer graphics for architectural and space planning
1986
On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
1995
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
1997
Partitioning procedures for solving mixed-variables programming problems
1962 Standout
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
2003 Standout
Inequality Restrictions in Regression Analysis
1966
Consistent Force Field Calculations. II. Crystal Structures, Sublimation Energies, Molecular and Lattice Vibrations, Molecular Conformations, and Enthalpies of Alkanes
1970 StandoutNobel
An Alternating Frequency/Time Domain Method for Calculating the Steady-State Response of Nonlinear Dynamic Systems
1989 Standout
Multiple Regression with Inequality Constraints: Pretesting Bias, Hypothesis Testing and Efficiency
1970 StandoutNobel
SIMPLE STRATEGIES FOR PORTFOLIO DIVERSIFICATION: COMMENT
1972 StandoutNobel
Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
1990 StandoutNobel
Applications of the method of partial inverses to convex programming: Decomposition
1985
Interactive decision software and computer graphics for architectural and space planning
1985
An effective implementation of the Lin–Kernighan traveling salesman heuristic
2000 Standout
Management Models and Industrial Applications of Linear Programming
1957 Standout
A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
1966
Robust mixing forab initioquantum mechanical calculations
2008
Decomposition, Pricing for Decentralization and External Economies
1964
A fast procedure for computing the distance between complex objects in three-dimensional space
1988
A tutorial on ν‐support vector machines
2005
Organizational Information Requirements, Media Richness and Structural Design
1986 Standout
A Computer Simulation Test of the M-Form Hypothesis
1980
A review of feature selection techniques in bioinformatics
2007 Standout
On the choice of step size in subgradient optimization
1981
Computation of Competitive Equilibria by a Sequence of Linear Programs
1980 StandoutNobel
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
1985
Works of Philip Wolfe being referenced
Finding the nearest point in A polytope
1976
An algorithm for quadratic programming
1956 Standout
Decomposition Principle for Linear Programs
1960 Standout
The generalized simplex method for minimizing a linear form under linear inequality restraints
1955
A duality theorem for non-linear programming
1961
The Decomposition Algorithm for Linear Programs
1961
Recent Advances in Mathematical Programming
1964
The Simplex Method for Quadratic Programming
1959
The strict determinateness of certain infinite game
1955
Convergence Conditions for Ascent Methods
1969
Validation of subgradient optimization
1974 Standout
Aspects of the traveling salesman problem
1984
Accelerating the Cutting Plane Method for Nonlinear Programming
1961
On the Convergence of Gradient Methods under Constraint
1972
The Simplex Method for Quadratic Programming
1960
Linear Convergence of the Conjugate Gradient Method
1972
The Secant method for simultaneous nonlinear equations
1959
Convergence Conditions for Ascent Methods. II: Some Corrections
1971