Journal: Optimization Letters

Volume 9, Issue 8

1475 -- 1476Vladimir Boginski, Eduardo L. Pasiliao, Siqian Shen. Special issue on optimization in military applications
1477 -- 1494Dennis P. Michalopoulos, J. Wesley Barnes, David P. Morton. Prioritized interdiction of nuclear smuggling via tabu search
1495 -- 1510Fabio D'Andreagiovanni. Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization
1511 -- 1531Benjamin C. Grannan, Nathaniel D. Bastian, Laura A. McLay. A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets
1533 -- 1552Longfei Wang, Jie Song, Leyuan Shi. Dynamic emergency logistics planning: models and heuristic algorithm
1553 -- 1568Zhouchun Huang, Qipeng P. Zheng. Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
1569 -- 1583Anke Stieber, Armin Fügenschuh, Maria Epp, Matthias Knapp, Hendrik Rothe. The multiple traveling salesmen problem with moving targets
1585 -- 1607Jean Berger, Nassirou Lo, Abdeslem Boukhtouta, Martin Noël. An information theoretic based integer linear programming approach for the discrete search path planning problem
1609 -- 1624Tanya E. Kannon, Sarah G. Nurre, Brian J. Lunday, Raymond R. Hill. The aircraft routing problem with refueling
1625 -- 1639Nils-Hassan Quttineh, Torbjörn Larsson. Military aircraft mission planning - Efficient model-based metaheuristic approaches
1641 -- 1657Daniel Stimpson, Rajesh Ganesan. A reinforcement learning approach to convoy scheduling on a contested transportation network
1659 -- 1674Magnar Vestli, Lars Lundsbakken, Kjetil Fagerholt, Lars Magnus Hvattum. Scheduling fighter squadron training missions using column generation
1675 -- 1688Ryan R. Squires, Karla L. Hoffman. A military maintenance planning and scheduling problem
1689 -- 1701Darryl K. Ahner, Carl Parson. Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
1703 -- 1727Philipp Hungerländer. A semidefinite optimization approach to the Target Visitation Problem
1729 -- 1748Necip Dirik, Shane N. Hall, James T. Moore. Maximizing strike aircraft planning efficiency for a given class of ground targets
1749 -- 1767Dinçer Konur, Cihan H. Dagli. Military system of systems architecting with individual system contracts
1769 -- 1785Andrew O. Hall, Michael C. Fu. Optimal Army officer force profiles
1787 -- 1803Monali S. Malvankar-Mehta, Siddhartha S. Mehta. Optimal task allocation in multi-human multi-robot interaction

Volume 9, Issue 7

1263 -- 1269Jean B. Lasserre. Volume of slices and sections of the simplex in closed form
1271 -- 1282Björn Sachsenberg, Klaus Schittkowski. A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
1283 -- 1295Jianqiang Cheng, Michal Houda, Abdel Lisser. Chance constrained 0-1 quadratic programs using copulas
1297 -- 1314Emilio Carrizosa, Anton Ushakov, Igor Vasilyev. Threshold robustness in discrete facility location problems: a bi-objective approach
1315 -- 1329Yan Xia, Murat Kurt. Control-limit policies for a class of stopping time problems with termination restrictions
1331 -- 1339Gary A. Kochenberger, Mark W. Lewis, Fred Glover, Haibo Wang. Exact solutions to generalized vertex covering problems: a comparison of two models
1341 -- 1351Jinkui Liu, Shengjie Li. Spectral gradient method for impulse noise removal
1353 -- 1369Sorin Radulescu, Diana-Olimpia Alexandrescu, Vicentiu D. Radulescu. Facility location in normed linear spaces
1371 -- 1391Natasa Krejic, Zorana Luzanin, Filip Nikolovski, Irena Stojkovska. A nonmonotone line search method for noisy minimization
1393 -- 1399José M. Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro. The least square nucleolus is a normalized Banzhaf value
1401 -- 1410Prasit Cholamjiak. The modified proximal point algorithm in CAT(0) spaces
1411 -- 1420Kaiping Luo, Xinhui Zhang. A simple proof technique for scheduling models with learning effects
1421 -- 1432Xiao-Liang Dong, Hongwei Liu, Yin Ling Xu, Xi Mei Yang. Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
1433 -- 1445Xinhe Miao, Jein-Shan Chen. Characterizations of solution sets of cone-constrained convex programming problems
1447 -- 1468Massimiliano Caramia, Renato Mari. Enhanced exact algorithms for discrete bilevel linear problems
1469 -- 1474Olvi L. Mangasarian. A hybrid algorithm for solving the absolute value equation

Volume 9, Issue 6

1039 -- 1052Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman. On a convex set with nondifferentiable metric projection
1053 -- 1061Olav Bjerkholt, Sjur Didrik Flåm. Ragnar Frisch and interior-point methods
1063 -- 1073Shu Wang, Yong Xia. Strong duality for generalized trust region subproblem: S-lemma with interval bounds
1075 -- 1090Youpan Han, Zhiping Chen. Quantitative stability of full random two-stage stochastic programs with recourse
1091 -- 1103Rajan Filomeno Coelho. Bi-objective hypervolume-based Pareto optimization - A gradient-based approach as an alternative to evolutionary algorithms
1105 -- 1119G. Q. Wang, X. J. Fan, D. T. Zhu, D. Z. Wang. ∗(κ)-LCP
1121 -- 1129Nader Kanzi. On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
1131 -- 1147Valeriano A. de Oliveira, Lucelina B. dos Santos, Rafaela Osuna Gómez, Marko Antonio Rojas-Medar. Optimality conditions for nonlinear infinite programming problems
1149 -- 1175B. C. Giri, S. Sharma. An integrated inventory model for a deteriorating item with allowable shortages and credit linked wholesale price
1177 -- 1185Joydeep Dutta. Barrier method in nonsmooth convex optimization without convex representation
1187 -- 1197Mohammadali Shirazi, Hedayat Z. Aashtiani. Solving the minimum toll revenue problem in real transportation networks
1199 -- 1212Kai Wang, Jitamitra Desai, Hongjin He. A note on augmented Lagrangian-based parallel splitting method
1213 -- 1229Wei Lv, Qiang Sun, He Lin, Ruirui Sui. A penalty derivative-free algorithm for nonlinear constrained optimization
1231 -- 1245Meijuan Shang, Chao Zhang, Dingtao Peng, Shenglong Zhou. A half thresholding projection algorithm for sparse solutions of LCPs
1247 -- 1254Holger H. Hoos, Thomas Stützle. On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
1255 -- 1258Isabel Correia, Francisco Saldanha-da-Gama. A note on "branch-and-price approach for the multi-skill project scheduling problem"
1259 -- 1262Boris Mirkin. Book review "Cell formation in industrial engineering: theory, algorithms and experiments" by Boris Goldengorin, Dmitry Krushinsky, Panos M. Pardalos - Springer, 2013

Volume 9, Issue 5

819 -- 838Zizhuo Wang. On solving convex optimization problems with linear ascending constraints
839 -- 843D. S. Malyshev, Panos M. Pardalos. The clique problem for graphs with a few eigenvalues of the same sign
845 -- 865Rommel G. Regis. The calculus of simplex gradients
867 -- 885Radu Ioan Bot, Christopher Hendrich. Convex risk minimization via proximal splitting methods
887 -- 895Victor Magron. Error bounds for polynomial optimization over the hypercube using putinar type representations
897 -- 913Atsushi Miyauchi, Noriyoshi Sukegawa. Maximizing Barber's bipartite modularity is also hard
915 -- 929Milagros Loreto, Alejandro Crema. Convergence analysis for the modified spectral projected subgradient method
931 -- 948Sona Taheri, Musa A. Mammadov. Structure learning of Bayesian Networks using global optimization with applications in data classification
949 -- 960Ciaran McCreesh, Patrick Prosser. A parallel branch and bound algorithm for the maximum labelled clique problem
961 -- 979Hui Zhang, Lizhi Cheng. Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
981 -- 998Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung. Moderately exponential time algorithms for the maximum induced matching problem
999 -- 1015Ioannis E. Livieris, Panagiotis E. Pintelas. A modified Perry conjugate gradient method and its global convergence
1017 -- 1023Juan Enrique Martínez-Legaz. Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
1025 -- 1037Mengyang Gu, Zhiyi Tan, Binzhou Xia, Yujie Yan. A new approach for bicriteria partitioning problem

Volume 9, Issue 4

615 -- 633Chrysafis Vogiatzis, Alexander Veremyev, Eduardo L. Pasiliao, Panos M. Pardalos. An integer programming approach for finding the most and the least central cliques
635 -- 661C. A. Valle, Nigel Meade, John E. Beasley. An optimisation approach to constructing an exchange-traded fund
663 -- 675Oscar C. Vásquez. For the airplane refueling problem local precedence implies global precedence
677 -- 692Tiago Araújo Neves, Luiz Satoru Ochi, Célio Vinicius N. de Albuquerque. A new hybrid heuristic for replica placement and request distribution in content distribution networks
693 -- 729Z. R. Gabidullina. Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
731 -- 741Orizon P. Ferreira, Sandor Z. Németh. Projection onto simplicial cones by a semi-smooth Newton method
743 -- 753Maryam Tahmasbi, Narges Mirehi. Thick non-crossing paths in a polygonal domain
755 -- 768Caiping Liu, Xinmin Yang. Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
769 -- 777Ovidiu Bagdasar, Nicolae Popovici. Local maximum points of explicitly quasiconvex functions
779 -- 794Chang-jie Fang, Sheng-lan Chen. A projection algorithm for set-valued variational inequalities on Hadamard manifolds
795 -- 797Wei Li. A note on dependency between interval linear systems
799 -- 817Effrosyni Theodorou, Ali Diabat. A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results

Volume 9, Issue 3

413 -- 425Marco Locatelli, Massimiliano Vasile. (Non) convergence results for the differential evolution method
427 -- 436Adam Kasperski, Pawel Zielinski. Complexity of the robust weighted independent set problems on interval graphs
437 -- 450Luigi Di Puglia Pugliese, Francesca Guerriero, José Luis Santos. Dynamic programming for spanning tree problems: application to the multi-objective case
451 -- 464Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes. The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
465 -- 482Imen Hamdi, Taïcir Loukil. Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
483 -- 503Boualem Alleche, Vicentiu D. Radulescu, Madjid Sebaoui. The Tikhonov regularization for equilibrium problems and applications to quasi-hemivariational inequalities
505 -- 512Qinghong Zhang. A note on the minimal cone for conic linear programming
513 -- 521María J. Cánovas, Abderrahim Hantoute, Juan Parra, F. Javier Toledo. Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
523 -- 535Cheng Lu, Xiaoling Guo. Convex reformulation for binary quadratic programming problems via average objective value maximization
537 -- 567Weiya Zhong. An improved algorithm for integrated production and distribution scheduling problem with committed delivery dates
569 -- 584Francisco J. Aragón Artacho, Ronan M. T. Fleming. Globally convergent algorithms for finding zeros of duplomonotone mappings
585 -- 600Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao. Potential energy principles in networked systems and their connections to optimization problems on graphs
601 -- 614Celso C. Ribeiro, Isabel Rosseti. tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms

Volume 9, Issue 2

209 -- 223Samir Elhedhli, Fatma Gzara. Characterizing the optimality gap and the optimal packings for the bin packing problem
225 -- 244Jia Tang, Changfeng Ma. A smoothing Newton method for symmetric cone complementarity problems
245 -- 261Elena Constantin. Second-order necessary conditions in locally Lipschitz optimization with inequality constraints
263 -- 282Giuseppe Marino, Luigi Muglia. On the auxiliary mappings generated by a family of mappings and solutions of variational inequalities problems
283 -- 310D. Ataee Tarzanagh, Z. Saeidian, M. Reza Peyghami, H. Mesgarani. A new trust region method for solving least-square transformation of system of equalities and inequalities
311 -- 327Antonio J. Vázquez, R. Scott Erwin. On the tractability of satellite range scheduling
329 -- 343Prashanto Chatterjee, C. S. Lalitha. Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
345 -- 357Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux. Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
359 -- 374V. Momenaei Kermani, A. R. Doagooei. Vector topical functions and Farkas type theorems with applications
375 -- 390Adil M. Bagirov, Julien Ugon, Hijran G. Mirzayeva. An algorithm for clusterwise linear regression based on smoothing techniques
391 -- 401Ke Quan Zhao, Xin-Min Yang. Characterizations of efficiency in vector optimization with $$\mathcal {C}(T)$$ C ( T ) -valued mappings
403 -- 412Ming Liu, Feifeng Zheng, Jinfeng Li. Scheduling small number of quay cranes with non-interference constraint

Volume 9, Issue 1

1 -- 18V. Jeyakumar, G. Y. Li, J. Vicente-Pérez. Robust SOS-convex polynomial optimization problems: exact SDP relaxations
19 -- 39Warren P. Adams, Hanif D. Sherali. RLT insights into lift-and-project closures
41 -- 55Phillippe Samer, Sebastián Urrutia. A branch and cut algorithm for minimum spanning trees under conflict constraints
57 -- 74Giampaolo Liuzzi, Francesco Rinaldi. 0-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
75 -- 90Guo-ji Tang, Xing Wang, Zhong Bao Wang. Existence of variational quasi-hemivariational inequalities involving a set-valued operatorand a nonlinear term
91 -- 104Jun Pei, Xinbao Liu, Panos M. Pardalos, Wenjuan Fan, Shanlin Yang. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
105 -- 118V. Pragadeeswarar, M. Marudai. Best proximity points for generalized proximal weak contractions in partially ordered metric spaces
119 -- 142Elham Mardaneh, Louis Caccetta. Impact of price-adjustments costs on integration of pricing and production planning of multiple-products
143 -- 154Ayse Akbalik, Bernard Penz, Christophe Rapine. Multi-item uncapacitated lot sizing problem with inventory bounds
155 -- 170Xia-bo Li, Nan-Jing Huang. Generalized vector quasi-equilibrium problems on Hadamard manifolds
171 -- 0Xiao-bo Li, Nan-Jing Huang. Erratum to: Generalized vector quasi-equilibrium problems on Hadamard manifolds
173 -- 187Mariano Luque. Modified interactive chebyshev algorithm (MICA) for non-convex multiobjective programming
189 -- 198Carlos Segura, Carlos A. Coello Coello, Eduardo Segredo, Coromoto León. On the adaptation of the mutation scale factor in differential evolution
199 -- 207Atsushi Miyauchi, Noriyoshi Sukegawa. Redundant constraints in the standard formulation for the clique partitioning problem