Branch and cut algorithms for detecting critical nodes in undirected graphs Marco Di SummaAndrea GrossoMarco Locatelli OriginalPaper 09 February 2012 Pages: 649 - 680
A local relaxation method for the cardinality constrained portfolio optimization problem Walter MurrayHoward Shek OriginalPaper 07 March 2012 Pages: 681 - 709
Computing the variance of tour costs over the solution space of the TSP in polynomial time Paul J. SutcliffeAndrew SolomonJenny Edwards OriginalPaper 07 March 2012 Pages: 711 - 728
A computational analysis of lower bounds for big bucket production planning problems Kerem AkartunalıAndrew J. Miller OriginalPaper 09 February 2012 Pages: 729 - 753
Descentwise inexact proximal algorithms for smooth optimization Marc FuentesJérôme MalickClaude Lemaréchal OriginalPaper 09 February 2012 Pages: 755 - 769
Constrained Dogleg methods for nonlinear systems with simple bounds Stefania BellaviaMaria MacconiSandra Pieraccini OriginalPaper 07 March 2012 Pages: 771 - 794
A new modified nonmonotone adaptive trust region method for unconstrained optimization Zhaocheng CuiBoying Wu OriginalPaper 10 February 2012 Pages: 795 - 806
Generalized weak sharp minima in cone-constrained convex optimization with applications H. L. LuoX. X. HuangJ. W. Peng OriginalPaper 03 February 2012 Pages: 807 - 821
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization Hayato WakiMaho NakataMasakazu Muramatsu OriginalPaper 28 September 2011 Pages: 823 - 844
On solving biquadratic optimization via semidefinite relaxation Yuning YangQingzhi Yang OriginalPaper 10 February 2012 Pages: 845 - 867
A genetic algorithm based augmented Lagrangian method for constrained optimization Kalyanmoy DebSoumil Srivastava OriginalPaper 07 March 2012 Pages: 869 - 902
Computational optimization strategies for the simulation of random media and components Edoardo PatelliGerhart I. Schuëller OriginalPaper 09 February 2012 Pages: 903 - 931
