Journal: Optimization Letters

Volume 3, Issue 4

483 -- 489Andrew J. Schaefer. Inverse integer programming
491 -- 497Yujun Zheng, Chuanqing Xu, Jinyun Xue. A simple greedy algorithm for a class of shuttle transportation problems
499 -- 505Cloud Makasu. Bounds for a constrained optimal stopping problem
507 -- 512Atle Seierstad, Knut Sydsæter. Conditions implying the vanishing of the Hamiltonian at infinity in optimal control problems
513 -- 520André R. S. Amaral. A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
521 -- 535Giovanni Fasano, Stefano Lucidi. A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
537 -- 545V. Jeyakumar, G. Y. Li. Farkas lemma for separable sublinear inequalities without qualifications
547 -- 557M. Daldoul, A. Baccari. An application of matrix computations to classical second-order optimality conditions
559 -- 571Semra Agrali, Joseph Geunes. A single-resource allocation problem with Poisson resource requirements
573 -- 582Igor V. Konnov. A splitting type algorithm for multi-valued complementarity problems
583 -- 592Hatem Hadda. A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints
593 -- 602Alexander J. Zaslavski. A sufficient condition for exact penalty functions
603 -- 606Jiri Rohn. On unique solvability of the absolute value equation

Volume 3, Issue 3

319 -- 328Valeriano Antunes de Oliveira, Marko Antonio Rojas-Medar. Proper efficiency in vector infinite programming problems
329 -- 335Muhammad Aslam Noor, Khalida Inayat Noor, Abdelouahed Hamdi, Eman H. El-Shemas. On difference of two monotone operators
337 -- 345X. J. Long, Z. Y. Peng, B. Zeng. Remark on cone semistrictly preinvex functions
347 -- 355Steffen Rebennack, Artyom G. Nahapetyan, Panos M. Pardalos. Bilinear modeling solution approach for fixed charge network flow problems
357 -- 366Mario R. Guarracino, Altannar Chinchuluun, Panos M. Pardalos. Decision rules for efficient classification of biological data
367 -- 376Michel Minoux. On robust maximum flow with polyhedral uncertainty sets
377 -- 386Francesco Rinaldi. New results on the equivalence between zero-one programming and continuous concave programming
387 -- 396Josef Haberl. On global minima of semistrictly quasiconcave functions
397 -- 409Andrea Cassioli, Marco Sciandrone. A convergent decomposition method for box-constrained optimization problems
411 -- 418Muhammad Aslam Noor. Projection methods for nonconvex variational inequalities
419 -- 435Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando. On solving generalized Nash equilibrium problems via optimization
437 -- 451Muhammad Aslam Noor. On a system of general mixed variational inequalities
453 -- 459Shu Xu, Sheng-Jie Li. A new proof approach to lower semicontinuity for parametric vector equilibrium problems
461 -- 473Vladimir L. Boginski, Clayton W. Commander, Timofey Turko. Polynomial-time identification of robust network flows under uncertain arc failures
475 -- 482Luís N. Vicente. Implicitly and densely discrete black-box optimization problems

Volume 3, Issue 2

161 -- 170O. L. Mangasarian. Knapsack feasibility as an absolute value equation solvable by successive linear programming
171 -- 185S. K. Mishra, J. S. Rautela. On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
187 -- 198Imre Pólik, Tamás Terlaky. New stopping criteria for detecting infeasibility in conic optimization
199 -- 210Amir Azaron, Farhad Kianfar. Due date assignment for multistage assembly systems
211 -- 237Katta G. Murty. A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
239 -- 251Sanjay Sharma. A composite model in the context of a production-inventory system
253 -- 263Yong Xia. New optimality conditions for quadratic optimization problems with binary constraints
265 -- 276Linxia Qin, Lingchen Kong, Jiye Han. Sufficiency of linear transformations on Euclidean Jordan algebras
277 -- 286Z. Husain, I. Ahmad, Sarita Sharma. Second order duality for minmax fractional programming
287 -- 295Samuel Rota Bulò, Marcello Pelillo. A generalization of the Motzkin-Straus theorem to hypergraphs
297 -- 302Yongxi Cheng, Ding-Zhu Du, Guohui Lin. On the upper bounds of the minimum number of rows of disjunct matrices
303 -- 318Dmitri E. Kvasov, Yaroslav D. Sergeyev. A univariate global search working with a set of Lipschitz constants for the first derivative

Volume 3, Issue 1

7 -- 10Olga Brezhneva, Alexey Tret yakov, Stephen E. Wright. A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
11 -- 21Gonglin Yuan. Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
23 -- 33V. Jeyakumar, S. Srisatkunarajah. Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
35 -- 47Mark A. Abramson, Charles Audet, James W. Chrissis, Jennifer G. Walston. Mesh adaptive direct search algorithms for mixed variable optimization
49 -- 62Angelos Tsoukalas, Panos Parpas, Berç Rustem. A smoothing algorithm for finite min-max-min problems
63 -- 75Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002, Weili Wu. Optimization scheme for sensor coverage scheduling with bandwidth constraints
77 -- 88Reshma Khemchandani, Jayadeva, Suresh Chandra. Optimal kernel selection in twin support vector machines
89 -- 100E. Naraghirad. Characterizations of simultaneous farthest point in normed linear spaces with applications
101 -- 108O. L. Mangasarian. A generalized Newton method for absolute value equations
109 -- 121Leo Liberti, Nelson Maculan, Yue Zhang. Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem
123 -- 136Ahmed Ghoniem, Hanif D. Sherali. Complementary column generation and bounding approaches for set partitioning formulations
137 -- 160Katta G. Murty, Mohammad R. Oskoorouchi. Note on implementing the new sphere method for LP using matrix inversions sparingly