Optimization Letters, Volume 5

Volume 5, Number 1, February 2011

• Juan P. Ruiz, Ignacio E. Grossmann:
  Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks. 1-11
  
• Raymond Hemmecke, Shmuel Onn, Robert Weismantel:
  N-fold integer programming and nonlinear multi-transshipment. 13-25
  
• Tiru S. Arthanari, Le Thi Hoai An:
  New formulations of the multiple sequence alignment problem. 27-40
  
• Agnieszka B. Malinowska, Natália Martins, Delfim F. M. Torres:
  Transversality conditions for infinite horizon variational problems on time scales. 41-53
  
• J. Zeng, S. J. Li:
  On vector variational-like inequalities and set-valued optimization problems. 55-69
  
• Thomas C. Sharkey:
  Network flow problems with pricing decisions. 71-83
  
• C. R. Chen, S. J. Li, J. Zeng, X. B. Li:
  Error analysis of approximate solutions to parametric vector quasiequilibrium problems. 85-98
  
• A. Causa, Fabio Raciti:
  Some remarks on the Walras equilibrium problem in Lebesgue spaces. 99-112
  
• Somayeh Moazeni:
  A note on the dynamic liquidity trading problem with a mean-variance objective. 113-124
  
• S. K. Gupta, N. Kailey:
  Nondifferentiable multiobjective second-order symmetric duality. 125-139
  
• Marius Durea, Radu Strugariu:
  Optimality conditions in terms of Bouligand derivatives for Pareto efficiency in set-valued optimization. 141-151
  
• Pavlo A. Krokhmal:
  On optimality of a polynomial algorithm for random linear multidimensional assignment problem. 153-164
  
• O. L. Mangasarian:
  Privacy-preserving linear programming. 165-172
  
• Lina Mallozzi:
  Cooperative games in facility location situations with regional fixed costs. 173-181
  
• Chuanli Zhao, Hengyong Tang:
  A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints. 183-190
  
• Charles Audet:
  A short proof on the cardinality of maximal positive bases. 191-194
  

Volume 5, Number 2, May 2011

• Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii Ursulenko:
  On connected domination in unit ball graphs. 195-205
  
• M. S. Apostolopoulou, D. G. Sotiropoulos, C. A. Botsaris, Panayiotis E. Pintelas:
  A practical method for solving large-scale TRS. 207-227
  
• Yu-Hsin Liu:
  A genetic local search algorithm with a threshold accepting mechanism for solving the runway dependent aircraft landing problem. 229-245
  
• Yuan Min Li, Xing Tao Wang, De Yun Wei:
  A new class of complementarity functions for symmetric cone complementarity problems. 247-257
  
• Subhash C. Sarin, Hanif D. Sherali, Liming Yao:
  New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem. 259-272
  
• Muhammad Aslam Noor, Khalida Inayat Noor:
  Iterative schemes for trifunction hemivariational inequalities. 273-282
  
• Klaus Schittkowski:
  A robust implementation of a sequential quadratic programming algorithm with successive error restoration. 283-296
  
• Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu Zhu, Ding-Zhu Du:
  An exact algorithm for minimum CDS with shortest path constraint in wireless networks. 297-306
  
• Cheng Xu, Xiao-Ming Xu, Hai-Feng Wang:
  The fractional minimal cost flow problem on network. 307-317
  
• David M. Chiang, Ruey-Shan Guo, Fan-Yun Pai:
  Retailer's optimal sourcing strategy by using one major supplier and one emergent supplier. 319-331
  
• Giorgio Gnecco, Marcello Sanguineti:
  Team optimization problems with Lipschitz continuous strategies. 333-346
  
• Giampaolo Liuzzi, Laura Palagi, Mauro Piacentini:
  On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds. 347-362
  

Volume 5, Number 3, August 2011

• Christopher Cullenbine, R. Kevin Wood, Alexandra Newman:
  A sliding time window heuristic for open pit mine block sequencing. 365-377
  
• Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
  Recoverable robust knapsacks: the discrete scenario case. 379-392
  
• Stefan Canzar, Nora C. Toussaint, Gunnar W. Klau:
  An exact algorithm for side-chain placement in protein design. 393-406
  
• Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
  Experiments with LAGRASP heuristic for set k-covering. 407-419
  
• Inken Wohlers, Rumen Andonov, Gunnar W. Klau:
  Algorithm engineering for optimal alignment of protein structure distance matrices. 421-433
  
• Chrysanthos E. Gounaris, Karthikeyan Rajendran, Ioannis G. Kevrekidis, Christodoulos A. Floudas:
  Generation of networks with prescribed degree-dependent clustering. 435-451
  
• Josef Kallrath:
  Polylithic modeling and solution approaches using algebraic modeling systems. 453-466
  
• Mauricio G. C. Resende, Celso C. Ribeiro:
  Restart strategies for GRASP with path-relinking heuristics. 467-478
  
• S. Andrew Johnson, Dinesh P. Mehta, Ramakrishna Thurimella:
  Identifying algorithmic vulnerabilities through simulated annealing. 479-490
  
• Torsten J. Gellert, Wiebke Höhn, Rolf H. Möhring:
  Sequencing and scheduling for filling lines in dairy production. 491-504
  
• Rong Hu, Ya-Ping Fang:
  Strict feasibility and solvability for vector equilibrium problems in reflexive Banach spaces. 505-514
  
• M. Valliathal, R. Uthayakumar:
  Designing a new computational approach of partial backlogging on the economic production quantity model for deteriorating items with non-linear holding cost under inflationary conditions. 515-530
  
• Francisco Facchinei, Simone Sagratella:
  On the computation of all solutions of jointly convex generalized Nash equilibrium problems. 531-547
  

Volume 5, Number 4, November 2011

• Jean B. Lasserre:
  On convex optimization without convex representation. 549-556
  
• Annamaria Sorato, Bruno Viscolani:
  Using several advertising media in a homogeneous market. 557-573
  
• Yaroslav D. Sergeyev:
  Higher order numerical differentiation on the Infinity Computer. 575-585
  
• Agnieszka B. Malinowska, Delfim F. M. Torres:
  A general backwards calculus of variations via duality. 587-599
  
• X. K. Sun, S. J. Li:
  Lower Studniarski derivative of the perturbation map in parametrized vector optimization. 601-614
  
• Zhi-feng Dai, Bo-Shi Tian:
  Global convergence of some modified PRP nonlinear conjugate gradient methods. 615-630
  
• Patric R. J. Östergård, Vesa P. Vaskelainen:
  Russian doll search for the Steiner triple covering problem. 631-638
  
• S. Sadiq Basha:
  Global optimal approximate solutions. 639-645
  
• B. Emamizadeh, J. V. Prajapat:
  Maximax and minimax rearrangement optimization problems. 647-664
  
• Yingnan Wang, Naihua Xiu, Ziyan Luo:
  A regularized strong duality for nonsymmetric semidefinite least squares problem. 665-682
  
• Xun-Hua Gong:
  A characterization of super efficiency in vector equilibrium problems. 683-690
  
• Habtu Zegeye, Naseer Shahzad:
  Approximating common solution of variational inequality problems for two monotone mappings in Banach spaces. 691-704
  
• Angelos Tsoukalas, Berç Rustem:
  A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming. 705-716
  
• X. J. Long, Y. Q. Huang, Z. Y. Peng:
  Optimality conditions for the Henig efficient solution of vector equilibrium problems with constraints. 717-728
  
• Changhe Liu, Hongwei Liu, Weijie Cong:
  An $${O(\sqrt{n}L)}$$ iteration primal-dual second-order corrector algorithm for linear programming. 729-743
  

Last update Wed May 22 18:09:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page