Content
January 2012, Volume 51, Issue 1
- 305-321 Monte Carlo algorithm for trajectory optimization based on Markovian readings
by Ronaldo Dias & Nancy Garcia & Adriano Zambom - 323-344 Partitioning planar graphs: a fast combinatorial approach for max-cut
by F. Liers & G. Pardella - 345-361 Kernel Search: a new heuristic framework for portfolio selection
by Enrico Angelelli & Renata Mansini & M. Speranza - 363-385 A branch-and-price approach for harvest scheduling subject to maximum area restrictions
by Isabel Martins & Filipe Alvelos & Miguel Constantino - 387-409 Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
by C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso - 411-435 A GRASP based on DE to solve single machine scheduling problem with SDST
by Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï - 437-455 An efficient label setting/correcting shortest path algorithm
by Antonio Sedeño-Noda & Carlos González-Martín
December 2011, Volume 50, Issue 3
- 463-464 International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences
by Hoai Le Thi & Joaquim Judice - 465-482 Multi-product lot-sizing and sequencing on a single imperfect machine
by A. Dolgui & M. Kovalyov & K. Shchamialiova - 483-506 Genetic Tabu search for robust fixed channel assignment under dynamic traffic data
by Hakim Mabed & Alexandre Caminada & Jin-Kao Hao - 507-524 On solving Linear Complementarity Problems by DC programming and DCA
by Hoai Le Thi & Tao Pham Dinh - 525-554 An efficient DC programming approach for portfolio decision with higher moments
by Tao Pham Dinh & Yi-Shuai Niu - 555-590 Inexact restoration method for minimization problems arising in electronic structure calculations
by Juliano Francisco & J. Martínez & Leandro Martínez & Feodor Pisnitchenko - 591-595 On solving the dual for portfolio selection by optimizing Conditional Value at Risk
by Włodzimierz Ogryczak & Tomasz Śliwiński - 597-617 Gradient algorithms for quadratic optimization with fast convergence rates
by Luc Pronzato & Anatoly Zhigljavsky - 619-628 Counterexamples to a triality theorem in “Canonical dual least square method”
by M. Voisei & C. Zălinescu
October 2011, Volume 50, Issue 2
- 189-192 Foreword
by Xiaojun Chen & Masao Fukushima - 193-221 The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions
by Hannes Buchholzer & Christian Kanzow & Peter Knabner & Serge Kräutle - 223-236 An interior-point path-following algorithm for computing a Leontief economy equilibrium
by Chuangyin Dang & Yinyu Ye & Zhisu Zhu - 237-262 Decomposition algorithms for generalized potential games
by Francisco Facchinei & Veronica Piccialli & Marco Sciandrone - 263-286 Pricing American options with uncertain volatility through stochastic linear complementarity models
by Kenji Hamatani & Masao Fukushima - 287-326 Network capacity management under competition
by Houyuan Jiang & Zhan Pang - 327-349 Block relaxation and majorization methods for the nearest correlation matrix with factor structure
by Qingna Li & Houduo Qi & Naihua Xiu - 351-378 A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds
by Chen Ling & Hongxia Yin & Guanglu Zhou - 379-401 A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure
by Fanwen Meng & Jie Sun & Mark Goh - 403-423 Computation of generalized differentials in nonlinear complementarity problems
by Shuhuang Xiang & Xiaojun Chen - 425-444 Compression and denoising using l 0 -norm
by Andy Yau & Xuecheng Tai & Michael Ng - 445-461 A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem
by Liping Zhang & Soon-Yi Wu
September 2011, Volume 50, Issue 1
- 1-22 Approximating Hessians in unconstrained optimization arising from discretized problems
by Vincent Malmedy & Philippe Toint - 23-48 Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
by Axel Dreves & Christian Kanzow - 49-73 A new class of penalized NCP-functions and its properties
by J.-S. Chen & Z.-H. Huang & C.-Y. She - 75-110 Some aspects of reachability for parabolic boundary control problems with control constraints
by Vili Dhamo & Fredi Tröltzsch - 111-145 A smooth penalty approach and a nonlinear multigrid algorithm for elliptic MPECs
by M. Hintermüller & I. Kopacka - 147-162 Shape optimization of an airfoil in the presence of compressible and viscous flows
by B. Farhadinia - 163-188 A realization of constraint feasibility in a moving least squares response surface based approximate optimization
by Chang Song & Jongsoo Lee
July 2011, Volume 49, Issue 3
- 407-433 A framework for analyzing sub-optimal performance of local search algorithms
by Alexander Nikolaev & Sheldon Jacobson & Shane Hall & Darrall Henderson - 435-456 An active index algorithm for the nearest point problem in a polyhedral cone
by Zhe Liu & Yahya Fathi - 457-491 The penalized Fischer-Burmeister SOC complementarity function
by Shaohua Pan & Jein-Shan Chen & Sangho Kum & Yongdo Lim - 493-520 A new hybrid method for nonlinear complementarity problems
by Shao-Jian Qu & Mark Goh & Xiujie Zhang - 521-548 Reduced quasi-Newton method for simultaneous design and optimization
by Adel Hamdi & Andreas Griewank - 549-566 Elliptic control problems with gradient constraints—variational discrete versus piecewise constant controls
by Andreas Günther & Michael Hinze - 567-600 Optimal control of the Stokes equations: conforming and non-conforming finite element methods under reduced regularity
by Serge Nicaise & Dieter Sirch
May 2011, Volume 49, Issue 1
- 1-15 Direct search algorithm for bilevel programming problems
by Ayalew Mersha & Stephan Dempe - 17-29 An improved proximal alternating direction method for monotone variational inequalities with separable structure
by Xiaoming Yuan - 31-59 A reduced Hessian SQP method for inequality constrained optimization
by Tao-Wen Liu - 61-99 A class of nonlinear Lagrangians for nonconvex second order cone programming
by Liwei Zhang & Jian Gu & Xiantao Xiao - 101-122 Augmented Lagrangian for cone constrained topology optimization
by Samuel Amstutz - 123-147 Optimal boundary control of the wave equation with pointwise control constraints
by Martin Gugat & Volker Grimm - 149-178 Numerical solution for optimal control of the reaction-diffusion equations in cardiac electrophysiology
by Chamakuri Nagaiah & Karl Kunisch & Gernot Plank - 179-192 Generalized viscosity approximation methods in multiobjective optimization problems
by Zhe Chen - 193-212 Minimum power multicasting in wireless networks under probabilistic node failures
by János Barta & Valeria Leggieri & Roberto Montemanni & Paolo Nobili & Chefi Triki
April 2011, Volume 48, Issue 3
- 423-452 Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
by Koichi Nabetani & Paul Tseng & Masao Fukushima - 453-485 Corrector-predictor methods for sufficient linear complementarity problems
by Filiz Gurtuna & Cosmin Petra & Florian Potra & Olena Shevchenko & Adrian Vancea - 487-514 Weighted variational inequalities in non-pivot Hilbert spaces with applications
by Annamaria Barbagallo & Stéphane Pia - 515-532 Sufficient descent directions in unconstrained optimization
by Xiao-Min An & Dong-Hui Li & Yunhai Xiao - 533-551 Planning wireless networks by shortest path
by C. Mannino & S. Mattia & A. Sassano - 553-579 Sensitivity analysis and calibration of the covariance matrix for stable portfolio selection
by Vincent Guigues - 581-600 Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment
by Michael Hinze & Anton Schiela - 601-633 A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems
by Matthias Gerdts & Martin Kunkel - 635-652 A global optimization method for the design of space trajectories
by Bernardetta Addis & Andrea Cassioli & Marco Locatelli & Fabio Schoen - 653-673 Relaxing the optimality conditions of box QP
by Samuel Burer & Jieqiu Chen - 675-695 Covering a polygonal region by rectangles
by Y. Stoyan & T. Romanova & G. Scheithauer & A. Krivulya - 697-715 Tabu search for the linear ordering problem with cumulative costs
by Abraham Duarte & Manuel Laguna & Rafael Martí - 717-745 Primal-dual interior-point method for thermodynamic gas-particle partitioning
by Alexandre Caboussat
January 2011, Volume 48, Issue 1
- 1-21 Local convergence analysis of inexact Newton-like methods under majorant condition
by O. Ferreira & M. Gonçalves - 23-44 Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
by Zdeněk Dostál & Marta Domorádová & Marie Sadowská - 45-58 A globally and quadratically convergent method for absolute value equations
by Louis Caccetta & Biao Qu & Guanglu Zhou - 59-70 An improved trust region algorithm for nonlinear equations
by Jinyan Fan & Jianyu Pan - 71-90 A cyclic scheduling problem with an undetermined number of parallel identical processors
by Přemysl Šůcha & Zdeněk Hanzálek - 91-108 How much do we “pay” for using default parameters?
by Mustafa Baz & Brady Hunsaker & Oleg Prokopyev - 109-138 A fast steady-state ε-dominance multi-objective evolutionary algorithm
by Minqiang Li & Liu Liu & Dan Lin - 139-155 Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
by Li-Ning Xing & Ying-Wu Chen & Ke-Wei Yang
November 2010, Volume 47, Issue 3
- 377-400 Duality-based algorithms for total-variation-regularized image restoration
by Mingqiang Zhu & Stephen Wright & Tony Chan - 401-429 Exact penalties for variational inequalities with applications to nonlinear complementarity problems
by Thiago André & Paulo Silva - 431-453 Using an iterative linear solver in an interior-point method for generating support vector machines
by E. Gertz & Joshua Griffin - 455-476 Variable target value relaxed alternating projection method
by A. Cegielski & R. Dylewski - 477-499 An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
by Jein-Shan Chen & Shaohua Pan - 501-527 An aggregate deformation homotopy method for min-max-min problems with max-min constraints
by Hui-juan Xiong & Bo Yu - 529-552 Multiple machine continuous setup lotsizing with sequence-dependent setups
by Bernardo Almada-Lobo & Diego Klabjan & Maria Carravilla & José Oliveira - 553-566 Flexible-attribute problems
by Jurij Mihelič & Borut Robič
October 2010, Volume 47, Issue 2
- 179-206 A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
by Paul Tseng & Sangwoon Yun - 207-235 An iterative approach for cone complementarity problems for nonsmooth dynamics
by Mihai Anitescu & Alessandro Tasora - 237-255 Convergence analysis of a modified BFGS method on convex minimizations
by Gonglin Yuan & Zengxin Wei - 257-288 An algorithm for nonlinear optimization problems with binary variables
by Walter Murray & Kien-Ming Ng - 289-305 A new strategy for the undirected two-commodity maximum flow problem
by A. Sedeño-Noda & C. González-Martín & S. Alonso-Rodríguez - 307-333 Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite
by Djamal Habet & Michel Vasquez & Yannick Vimont - 335-347 Canonical dual least square method for solving general nonlinear systems of quadratic equations
by N. Ruan & David Gao & Y. Jiao - 349-376 Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling
by M. Baglietto & C. Cervellera & M. Sanguineti & R. Zoppoli
September 2010, Volume 47, Issue 1
- 1-31 A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
by Akiko Takeda & Shunsuke Taguchi & Tsutomu Tanaka - 33-59 Extended duality for nonlinear programming
by Yixin Chen & Minmin Chen - 61-76 Solving job shop scheduling problems utilizing the properties of backbone and “big valley”
by Panos Pardalos & Oleg Shylo & Alkis Vazacopoulos - 77-96 Route planning for agent-based information retrieval
by Irene Sygkouna & Marios-Polychronis Drakos & Miltiades Anagnostou - 97-128 Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
by Omid Bozorg Haddad & Mahsa Mirmomeni & Mahboubeh Zarezadeh Mehrizi & Miguel Mariño - 129-131 Morse potential energy minimization: Improved bounds for optimal configurations
by Bernardetta Addis & Werner Schachinger - 133-159 A posteriori error estimates for a finite element discretization of interior point methods for an elliptic optimization problem with state constraints
by W. Wollner - 161-178 Numerical approximation of the LQR problem in a strongly damped wave equation
by Erwin Hernández & Dante Kalise & Enrique Otárola
July 2010, Volume 46, Issue 3
- 391-415 Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
by Churlzu Lim & Hanif Sherali & Stan Uryasev - 417-426 Multi-step methods for choosing the best set of variables in regression analysis
by Hiroshi Konno & Yoshihiro Takaya - 427-450 A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
by João Claro & Jorge Sousa - 451-466 A comparison of feasible direction methods for the stochastic transportation problem
by Maria Daneva & Torbjörn Larsson & Michael Patriksson & Clas Rydergren - 467-486 Concave programming for minimizing the zero-norm over polyhedral sets
by F. Rinaldi & F. Schoen & M. Sciandrone - 487-510 Variational discretization of Lavrentiev-regularized state constrained elliptic optimal control problems
by M. Hinze & C. Meyer - 511-533 Adaptive finite element methods for mixed control-state constrained optimal control problems for elliptic boundary value problems
by R. Hoppe & M. Kieweg - 535-569 A shape and topology optimization technique for solving a class of linear complementarity problems in function space
by M. Hintermüller & A. Laurain
June 2010, Volume 46, Issue 2
- 189-191 Preface
by Ernesto Birgin - 193-215 Globalization strategies for Mesh Adaptive Direct Search
by Charles Audet & J. Dennis & Sébastien Digabel - 217-227 Residual algorithm for large-scale positive definite generalized eigenvalue problems
by Lenys Bello & William La Cruz & Marcos Raydan - 229-245 Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians
by Emerson Castelani & André Martinez & J. Martínez & B. Svaiter - 247-263 Convergence of direct methods for paramonotone variational inequalities
by J. Bello Cruz & A. Iusem - 265-278 Incorporating minimum Frobenius norm models in direct search
by A. Custódio & H. Rocha & L. Vicente - 279-304 Proximal methods for nonlinear programming: double regularization and inexact subproblems
by Jonathan Eckstein & Paulo Silva - 305-332 Incremental-like bundle methods with application to energy planning
by Grégory Emiel & Claudia Sagastizábal - 333-346 A new line search inexact restoration approach for nonlinear programming
by Andreas Fischer & Ana Friedlander - 347-368 Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
by A. Izmailov & M. Solodov - 369-389 A model for optimal execution of atomic orders
by Miles Kumaresan & Nataša Krejić
May 2010, Volume 46, Issue 1
- 1-29 A parallel interior point decomposition algorithm for block angular semidefinite programs
by Kartik Sivaramakrishnan - 31-49 Some non-interior path-following methods based on a scaled central path for linear complementarity problems
by Wang Qinggang & Zhao Jinling & Yang Qingzhi - 51-73 A column generation method for the multiple-choice multi-dimensional knapsack problem
by N. Cherfi & M. Hifi - 75-92 Covering a compact polygonal set by identical circles
by Y. Stoyan & V. Patsuk - 93-111 Approximation of low rank solutions for linear quadratic control of partial differential equations
by Kirsten Morris & Carmeliza Navasca - 113-133 α-Conservative approximation for probabilistically constrained convex programs
by Yuichi Takano & Jun-ya Gotoh - 135-157 Multi-objective Pareto-optimal control: an application to wastewater management
by L. Alvarez-Vázquez & N. García-Chan & A. Martínez & M. Vázquez-Méndez - 159-188 A multi-objective optimization evolutionary algorithm incorporating preference information based on fuzzy logic
by Xiaoning Shen & Yu Guo & Qingwei Chen & Weili Hu
April 2010, Volume 45, Issue 3
- 475-493 Efficient preprocessing for VLSI optimization problems
by W. Hare & M. Liu & T. Terlaky - 495-520 New approach for the nonlinear programming with transient stability constraints arising from power systems
by Xiaojiao Tong & Soon-Yi Wu & Renjun Zhou - 521-541 A penalized nonparametric method for nonlinear constrained optimization based on noisy data
by Ronaldo Dias & Nancy Garcia & Adriano Zambom - 543-555 A computational study of exact knapsack separation for the generalized assignment problem
by Pasquale Avella & Maurizio Boccia & Igor Vasilyev - 557-579 Smoothing algorithms for complementarity problems over symmetric cones
by Zheng-Hai Huang & Tie Ni - 581-606 A one-parametric class of merit functions for the second-order cone complementarity problem
by Jein-Shan Chen & Shaohua Pan - 607-638 Solving chance-constrained combinatorial problems to optimality
by Olivier Klopfenstein - 639-661 Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
by Akbar Karimi & Hadi Nobahari & Patrick Siarry
January 2010, Volume 45, Issue 1
- 1-24 An inexact modified subgradient algorithm for nonconvex optimization
by Regina Burachik & C. Kaya & Musa Mammadov - 25-57 Cone-constrained eigenvalue problems: theory and algorithms
by A. Pinto da Costa & A. Seeger - 59-88 A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
by Shaohua Pan & Jein-Shan Chen - 89-109 Some projection-like methods for the generalized Nash equilibria
by Jianzhong Zhang & Biao Qu & Naihua Xiu - 111-141 Heuristics for the facility location and design (1|1)-centroid problem on the plane
by J. Redondo & J. Fernández & I. García & P. Ortigosa - 143-158 Fast paths in large-scale dynamic road networks
by Giacomo Nannicini & Philippe Baptiste & Gilles Barbier & Daniel Krob & Leo Liberti - 159-179 An algorithm for the estimation of a regression function by continuous piecewise linear functions
by Adil Bagirov & Conny Clausen & Michael Kohler - 181-203 OSiL: An instance language for optimization
by Robert Fourer & Jun Ma & Kipp Martin
December 2009, Volume 45, Issue 4
- 499-531 Interval propagation and search on directed acyclic graphs for numerical constraint solving
by Xuan-Ha Vu & Hermann Schichl & Djamila Sam-Haroud - 533-549 Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint
by Harish Palanthandalam-Madapusi & Tobin Van Pelt & Dennis Bernstein - 551-563 Set containment characterization for quasiconvex programming
by Satoshi Suzuki & Daishi Kuroiwa - 565-581 On the existence of solutions to quasivariational inclusion problems
by Nguyen Hai & Phan Khanh & Nguyen Quan - 583-595 Stability of semi-infinite vector optimization problems under functional perturbations
by T. Chuong & N. Huy & J. Yao - 597-613 Equivalence theorem, consistency and axiomatizations of a multi-choice value
by Yan-An Hwang & Yu-Hsien Liao - 615-629 Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
by Qingxiang Zhang - 631-644 Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization
by Paul-Emile Maingé - 645-666 On optimal zero-preserving corrections for inconsistent linear systems
by Paula Amaral & Luís Fernandes & Joaquim Júdice & Hanif Sherali
December 2009, Volume 44, Issue 3
- 363-372 On equivalent reformulations for absolute value equations
by Oleg Prokopyev - 373-383 Improved convergence order for augmented penalty algorithms
by Jean-Pierre Dussault - 385-409 A bundle-type algorithm for routing in telecommunication data networks
by Claude Lemaréchal & Adam Ouorou & Georgios Petrou - 411-426 Hybrid heuristics for the maximum diversity problem
by Micael Gallego & Abraham Duarte & Manuel Laguna & Rafael Martí - 427-441 Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
by Elizabeth Karas & Elvio Pilotta & Ademir Ribeiro - 443-466 A successive SDP-NSDP approach to a robust optimization problem in finance
by F. Leibfritz & J. Maruhn - 467-485 An incomplete Hessian Newton minimization method and its application in a chemical database problem
by Dexuan Xie & Qin Ni - 487-519 New facets for the two-stage uncapacitated facility location polytope
by Mercedes Landete & Alfredo Marín - 521-524 COAP 2008 best paper award: Paper of M. Weiser, T. Gänzler, and A. Schiela
by W. Hager - 525-530 COAP 2008 best paper award: Paper of P.M. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu
by W. Hager
November 2009, Volume 44, Issue 2
- 159-181 Elliptic optimal control problems with L 1 -control cost and applications for the placement of control devices
by Georg Stadler - 183-212 Regularization of state-constrained elliptic optimal control problems with nonlocal radiation interface conditions
by C. Meyer & I. Yousept - 213-247 A stable primal–dual approach for linear programming under nondegeneracy assumptions
by Maria Gonzalez-Lima & Hua Wei & Henry Wolkowicz - 249-273 Scalarizations for adaptively solving multi-objective optimization problems
by Gabriele Eichfelder - 275-288 A FPTAS for a class of linear multiplicative problems
by Daniele Depetrini & Marco Locatelli - 289-313 Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem
by Dulce Rosas & Jordi Castro & Lídia Montero - 315-341 Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results
by Wolfgang Achtziger & Mathias Stolpe - 343-361 Computing the metric dimension of graphs by genetic algorithms
by Jozef Kratica & Vera Kovačević-Vujčić & Mirjana Čangalović
October 2009, Volume 44, Issue 1
- 1-2 Editorial
by Fredi Tröltzsch - 3-25 A posteriori error estimation and adaptivity for elliptic optimal control problems with state constraints
by Olaf Benedix & Boris Vexler - 27-55 Error estimates for the discretization of elliptic control problems with pointwise control and state constraints
by S. Cherednichenko & A. Rösch - 57-81 Sensitivity analysis and the adjoint update strategy for an optimal control problem with mixed control-state constraints
by Roland Griesse & Daniel Wachsmuth - 83-115 POD a-posteriori error estimates for linear-quadratic optimal control problems
by F. Tröltzsch & S. Volkwein - 117-138 On solving the Lagrangian dual of integer programs via an incremental approach
by Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico - 139-158 A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty
by Wang Yanjun & Li Tao & Liang Zhian
July 2009, Volume 43, Issue 3
- 307-328 An inexact-restoration method for nonlinear bilevel programming problems
by R. Andreani & S. Castro & J. Chela & A. Friedlander & S. Santos - 329-352 Analytic center of spherical shells and its application to analytic center machine
by Fernanda Raupp & B. Svaiter - 353-377 Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
by Anna Heusinger & Christian Kanzow - 379-409 A second-order cone cutting surface method: complexity and application
by Mohammad Oskoorouchi & John Mitchell - 411-436 Towards auction algorithms for large dense assignment problems
by Libor Buš & Pavel Tvrdík - 437-448 New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels
by A. Sedeño-Noda & C. González-Martín - 449-463 A combinatorial algorithm for the TDMA message scheduling problem
by Clayton Commander & Panos Pardalos
June 2009, Volume 43, Issue 2
- 151-179 Sum of squares method for sensor network localization
by Jiawang Nie - 181-195 Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
by Samuel Burer & Dieter Vandenbussche - 197-211 A globally convergent descent method for nonsmooth variational inequalities
by Barbara Panicucci & Massimo Pappalardo & Mauro Passacantando - 213-233 A virtual control concept for state constrained optimal control problems
by K. Krumbiegel & A. Rösch - 235-259 Mean and variance optimization of non–linear systems and worst–case analysis
by P. Parpas & B. Rustem & V. Wieland & S. Žaković - 261-294 Solving the linear multiple choice knapsack problem with two objectives: profit and equity
by George Kozanidis - 295-306 A proximal method for identifying active manifolds
by W. Hare
May 2009, Volume 43, Issue 1
- 1-22 Algorithm for cardinality-constrained quadratic optimization
by Dimitris Bertsimas & Romy Shioda - 23-37 Solving molecular distance geometry problems by global optimization algorithms
by Andrea Grosso & Marco Locatelli & Fabio Schoen - 39-65 A cutting plane algorithm for the capacitated facility location problem
by Pasquale Avella & Maurizio Boccia - 67-93 Scenario reduction in stochastic programming with respect to discrepancy distances
by René Henrion & Christian Küchler & Werner Römisch - 95-118 The piecewise linear-quadratic model for computational convex analysis
by Yves Lucet & Heinz Bauschke & Mike Trienis - 119-131 Truncated regularized Newton method for convex minimizations
by Ying-Jie Li & Dong-Hui Li - 133-150 Finite-difference discretizations of quadratic control problems governed by ordinary elliptic differential equations
by Walter Alt & Nils Bräutigam
April 2009, Volume 42, Issue 3
- 327-334 A restarting approach for the symmetric rank one update for unconstrained optimization
by Wah Leong & Malik Hassan - 335-352 Global error bounds for the extended vertical LCP
by Chao Zhang & Xiaojun Chen & Naihua Xiu - 353-370 Bounded-degree spanning tree problems: models and new algorithms
by R. Cerulli & M. Gentili & A. Iossa - 371-392 Benders, metric and cutset inequalities for multicommodity capacitated network design
by Alysson Costa & Jean-François Cordeau & Bernard Gendron