Facet browsing currently unavailable
Page 10 of 5431 results
Sort by: relevance publication year
Fractional packing in ideal clutters JOURNAL ARTICLE published June 2012 in Mathematical Programming |
In memory of Svatopluk Poljak JOURNAL ARTICLE published April 1997 in Mathematical Programming |
Discrete optimization JOURNAL ARTICLE published December 1977 in Mathematical Programming |
Interior point algorithms for linear programming with inequality constraints JOURNAL ARTICLE published May 1991 in Mathematical Programming |
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices JOURNAL ARTICLE published 1 September 2003 in Mathematical Programming |
Rudiments of an average case complexity theory for piecewise-linear path following algorithms JOURNAL ARTICLE published January 1988 in Mathematical Programming |
Efficient branch-and-bound algorithms for weighted MAX-2-SAT JOURNAL ARTICLE published April 2011 in Mathematical Programming |
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach JOURNAL ARTICLE published 1 May 2002 in Mathematical Programming |
JOURNAL ARTICLE published 1995 in Mathematical Programming |
Polyhedra related to a lattice JOURNAL ARTICLE published December 1981 in Mathematical Programming |
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification JOURNAL ARTICLE published January 1998 in Mathematical Programming |
Dual bin packing with items of random sizes JOURNAL ARTICLE published January 1993 in Mathematical Programming |
Duality gap of the conic convex constrained optimization problems in normed spaces JOURNAL ARTICLE published July 2009 in Mathematical Programming |
An inexact Newton method for nonconvex equality constrained optimization JOURNAL ARTICLE published April 2010 in Mathematical Programming |
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability JOURNAL ARTICLE published September 2008 in Mathematical Programming |
Thresholded covering algorithms for robust and max–min optimization JOURNAL ARTICLE published August 2014 in Mathematical Programming |
Newton’s iterates can converge to non-stationary points JOURNAL ARTICLE published 30 November 2007 in Mathematical Programming |
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks JOURNAL ARTICLE published March 1993 in Mathematical Programming |
Finding minimum-cost flows by double scaling JOURNAL ARTICLE published January 1992 in Mathematical Programming |
Truncated-Newton algorithms for large-scale unconstrained optimization JOURNAL ARTICLE published June 1983 in Mathematical Programming |