Journal: Optimization Letters

Volume 10, Issue 8

1593 -- 1612Dmitriy S. Malyshev, Panos M. Pardalos. Critical hereditary graph classes: a survey
1613 -- 1628Saumya Sinha, Archis Ghate. Policy iteration for robust nonstationary Markov decision processes
1629 -- 1644Hyunseok Cho, Kyoung-Kuk Kim, Kyungsik Lee. Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
1645 -- 1656Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin. Machine scheduling with a maintenance interval and job delivery coordination
1657 -- 1667Mansi Dhingra, C. S. Lalitha. Well-setness and scalarization in set optimization
1669 -- 1679Do Sang Kim, Phan Tu Vuong, Pham Duy Khanh. Qualitative properties of strongly pseudomonotone variational inequalities
1681 -- 1691Xiangyu Cui, Lu Xu, Yan Zeng. Continuous time mean-variance portfolio optimization with piecewise state-dependent risk aversion
1693 -- 1703Raka Jovanovic, Stefan Voß. A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
1705 -- 1723Hejie Wei, Wei Hong Yang. A Riemannian subspace limited-memory SR1 trust region method
1725 -- 1742Ioannis E. Livieris, Panagiotis E. Pintelas. A limited memory descent Perry conjugate gradient method
1743 -- 1755Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya. Weak infeasibility in second order cone programming
1757 -- 1762Majid Soleimani-Damaneh, Moslem Zamani. On Benson's scalarization in multiobjective optimization
1763 -- 1779Vittorio Latorre, David Yang Gao. Canonical duality for solving general nonconvex constrained problems
1781 -- 1787Constantin Zalinescu. On V. Latorre and D.Y. Gao's paper "Canonical duality for solving general nonconvex constrained problems"
1789 -- 1797Saman Babaie-Kafaki. On optimality of two adaptive choices for the parameter of Dai-Liao method

Volume 10, Issue 7

1379 -- 1392Miguel F. Anjos, Manuel V. C. Vieira. An improved two-stage optimization-based framework for unequal-areas facility layout
1393 -- 1401Zhao Zhang, Joonglyul Lee, Weili Wu, Ding-Zhu Du. Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
1403 -- 1416Jan Brinkhuis. Inner and outer approximation of convex sets using alignment
1417 -- 1448Rupaj Kumar Nayak, Jitamitra Desai. A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
1449 -- 1461Pablo C. Guedes, William Prigol Lopes, Leonardo Rosa Rohde, Denis Borenstein. Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
1463 -- 1478Xiang-Kai Sun, Zai Yun Peng, Xiao-Le Guo. Some characterizations of robust optimal solutions for uncertain convex optimization problems
1479 -- 1492André B. Chassein, Marc Goerigk. On the recoverable robust traveling salesman problem
1493 -- 1504Andrea Grosso, Fabio Salassa, Wim Vancroonenburg. Searching for a cycle with maximum coverage in undirected graphs
1505 -- 1518Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey. Stochastic graph partitioning: quadratic versus SOCP formulations
1519 -- 1528Yonghong Yao, Mihai Postolache, Yeong-Cheng Liou, Zhangsong Yao. Construction algorithms for a class of monotone variational inequalities
1529 -- 1539João Carlos O. Souza, Paulo Roberto Oliveira, Antoine Soubeyran. Global convergence of a proximal linearized algorithm for difference of convex functions
1541 -- 1560Maksim V. Dolgopolik. Smooth exact penalty functions II: a reduction to standard exact penalty functions
1561 -- 1576Tadeusz Antczak. The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
1577 -- 1592Ali Diabat. A capacitated facility location and inventory management problem with single sourcing

Volume 10, Issue 6

1141 -- 1151Marco Locatelli. Exactness conditions for an SDP relaxation of the extended trust region problem
1153 -- 1168Oliver Stein. Error bounds for mixed integer nonlinear optimization problems
1169 -- 1177Dmitry V. Gribanov, Sergey I. Veselov. On integer programming with bounded determinants
1179 -- 1189Dmitry V. Gribanov, A. Y. Chirkov. The width and integer optimization on simplices with bounded minors of the constraint matrices
1191 -- 1201Shun-Chieh Chang, William Chung-Kung Yen, Yue-Li Wang, Jia Jie Liu. The connected p-median problem on block graphs
1203 -- 1220Panayotis E. Nastou, Vasilis Papadinas, Panos M. Pardalos, Yannis C. Stamatiou. On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
1221 -- 1231Nguyen Thi Quynh Trang. A note on Lipschitzian stability of variational inequalities over perturbed polyhedral convex sets
1233 -- 1243Peter Richtárik, Martin Takác. On optimal probabilities in stochastic coordinate descent methods
1245 -- 1256Sascha Kurz, Stefan Napel. Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record
1257 -- 1268Longcheng Liu, Enyu Yao. Capacity inverse minimum cost flow problems under the weighted Hamming distance
1269 -- 1285Jungyun Bae, Sivakumar Rathinam. A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
1287 -- 1301Shengkun Zhu. Weak sharp efficiency in multiobjective optimization
1303 -- 1314Dimitris Souravlias, Konstantinos E. Parsopoulos, Ilias S. Kotsireas. Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
1315 -- 1325Luis Felipe Bueno, Gabriel Haeser, José Mario Martínez. An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
1327 -- 1336João X. da Cruz Neto, Paulo Sérgio Marques dos Santos, P. A. Soares Jr.. An extragradient method for equilibrium problems on Hadamard manifolds
1337 -- 1345Jianping Li, Li Guan, Honglin Ding, Weidong Li. Approximations for constructing tree-form structures using specific material with fixed length
1347 -- 1360Petro I. Stetsyuk, Tatiana E. Romanova, Guntram Scheithauer. On the global minimum in a balanced circular packing problem
1361 -- 1370Maryam Yashtini. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
1371 -- 1377Jean-Paul Penot. On the relations between some second-order derivatives

Volume 10, Issue 5

871 -- 873Giuseppe Bruno, Raffaele Cerulli, Monica Gentili. Models, algorithms and applications for location problems
875 -- 901Daniela Ambrosino, Anna Sciomachen. A capacitated hub location problem in freight logistics multimodal networks
903 -- 920Maria Barbati, Carmela Piccolo. Equality measures properties for location problems
921 -- 953Nathaniel D. Bastian, Paul M. Griffin, Eric Spero, Lawrence V. Fulton. Multi-criteria logistics modeling for military humanitarian assistance and disaster relief aerial delivery operations
955 -- 973Gianpiero Bianchi, Renato Bruni, Alessandra Reale, Fabio Sforzi. A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
975 -- 995Giuseppe Bruno, Andrea Genovese, Carmela Piccolo. Capacity management in public service facility networks: a model, computational tests and a case study
997 -- 1019Massimiliano Caramia, Renato Mari. A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
1021 -- 1052Luigi Di Puglia Pugliese, Francesca Guerriero, Dimitrios Zorbas, Tahiry Razafindralambo. Modelling the mobile target covering problem using flying drones
1053 -- 1070S. Khodaparasti, H. R. Maleki, Maria Elena Bruni, S. Jahedi, Patrizia Beraldi, Domenico Conforti. Balancing efficiency and equity in location-allocation models with an application to strategic EMS design
1071 -- 1086Wlodzimierz Ogryczak, Pawel Olender. Ordered median problem with demand distribution weights
1087 -- 1100Ahmed Saif, Samir Elhedhli. A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
1101 -- 1123Claudio Sterle, Antonio Sforza, Annunziata Esposito Amideo, Carmela Piccolo. A unified solving approach for two and three dimensional coverage problems in sensor networks
1125 -- 1139Chefi Triki. Location-based techniques for the synergy approximation in combinatorial transportation auctions

Volume 10, Issue 4

649 -- 654Warren Hare, H. Song. On the cardinality of positively linearly independent sets
655 -- 665Stéphane Gaubert, Zheng Qu, Srinivas Sridharan. Maximizing concave piecewise affine functions on the unitary group
667 -- 683Maurício C. de Souza, Aloísio C. Gomes Jr., Allan M. C. Bretas, Martín Gómez Ravetti. Models for scheduling charges in continuous casting: application to a Brazilian steel plant
685 -- 697Qingsong Tang, Yuejian Peng, Xiangde Zhang, Cheng Zhao. Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
699 -- 708M. Dodangeh, Luís N. Vicente, Z. Zhang. On the optimal order of worst case complexity of direct search
709 -- 729Amir Ali Ahmadi, Anirudha Majumdar. Some applications of polynomial optimization in operations research and real-time decision making
731 -- 736Guo Qiang Wang, Jiyuan Tao, Lingchen Kong. A note on an inequality involving Jordan product in Euclidean Jordan algebras
737 -- 752Feng He, Xiaoning Xu, Rong Chen, Na Zhang. Sensitivity and stability analysis in DEA with bounded uncertainty
753 -- 767Sheng-lan Chen, Nan-Jing Huang. Vector variational inequalities and vector optimization problems on Hadamard manifolds
769 -- 780Yuan Mei Xia, Wanli Zhang, Ke Quan Zhao. Characterizations of improvement sets via quasi interior and applications in vector optimization
781 -- 803Bang Công Vu. Almost sure convergence of the forward-backward-forward splitting algorithm
805 -- 819Mohammad M. Alshahrani, Suliman Al-Homidan, Qamrul Hasan Ansari. Minimum and maximum principle sufficiency properties for nonsmooth variational inequalities
821 -- 832Maziar Salahi, Saeed Fallahi. Trust region subproblem with an additional linear inequality constraint
833 -- 846M. Beatrice Lignola, Jacqueline Morgan. A method to bypass the lack of solutions in MinSup problems under quasi-equilibrium constraints
847 -- 863Archis Ghate. Robust optimization in countably infinite linear programs
865 -- 869Tamás Fleiner, Gábor Wiener. Coloring signed graphs using DFS

Volume 10, Issue 3

433 -- 446Abraham Berman, Mirjam Dür, Naomi Shaked-Monderer, Julia Witzel. Cutting planes for semidefinite relaxations based on triangle-free subgraphs
447 -- 455Heinz H. Bauschke, Walaa M. Moursi. On the order of the operators in the Douglas-Rachford algorithm
457 -- 472Xiaojun Zhou, David Yang Gao, Chunhua Yang. Global solutions to a class of CEC benchmark constrained optimization problems
473 -- 484Dimitra Alexiou. Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks
485 -- 497Xuewen Mu, Wenlong Liu. An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
499 -- 509Zhang Jian. A smoothing Newton algorithm for weighted linear complementarity problem
511 -- 525Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim. Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
527 -- 542Y. D. Xu. Nonlinear separation functions, optimality conditions and error bounds for Ky Fan quasi-inequalities
543 -- 562Ganggang Li, Xiwen Lu. Approximation algorithms for the single-machine scheduling with a period of maintenance
563 -- 576Yina Liu, Zili Wu. Characterization of weakly sharp solutions of a variational inequality by its primal gap function
577 -- 589S. K. Mishra, Vivek Laha. On minty variational principle for nonsmooth vector optimization problems with approximate convexity
591 -- 603B. Kheirfam. ∗(κ)-SCLCP
605 -- 617Raouf Senhadji Navarro, Ignacio Garcia-Vargas. Minimum maximum reconfiguration cost problem
619 -- 634Changhe Liu, Youlin Shang, Hongwei Liu. An (√n L) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
635 -- 648Maksim V. Dolgopolik. Smooth exact penalty functions: a general approach

Volume 10, Issue 2

215 -- 218Yaroslav D. Sergeyev. Preface to the Special Issue "Recent developments in non-linear and global optimization"
219 -- 235Stefano Lucidi, Massimo Maurici, Luca Paulon, Francesco Rinaldi, Massimo Roma. A derivative-free approach for a simulation-based optimization problem in healthcare
237 -- 246Remigijus Paulavicius, Julius Zilinskas. Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
247 -- 260Sergey P. Shary, Irene A. Sharaya. On solvability recognition for interval linear systems of equations
261 -- 282Tao Pham Dinh, Hoai An Le Thi, Viet Nga Pham, Yi-Shuai Niu. DC programming approaches for discrete portfolio optimization under concave transaction costs
283 -- 308Yannis A. Guzman, M. M. Faruque Hasan, Christodoulos A. Floudas. Performance of convex underestimators in a branch-and-bound framework
309 -- 324Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso. OMEGA one multi ethnic genetic approach
325 -- 340Yan Zhang, Nikolaos V. Sahinidis. Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment
341 -- 353Antanas Zilinskas, Anatoly Zhigljavsky. Branch and probability bound methods in multi-objective optimization
355 -- 368Annabella Astorino, Giovanna Miglionico. Optimizing sensor cover energy via DC programming
369 -- 381Andrei V. Orlov, Alexander S. Strekalovsky, S. Batbileg. On computational search for Nash equilibrium in hexamatrix games
383 -- 399Anke Tröltzsch. A sequential quadratic programming algorithm for equality-constrained optimization without derivatives
401 -- 416Trond Steihaug, Sara Suleiman. On the final steps of Newton and higher order methods
417 -- 432Guillaume Guérard, Ider Tseveendorj. Inscribed ball and enclosing box methods for the convex maximization problem

Volume 10, Issue 1

1 -- 0Pavlo A. Krokhmal, Oleg A. Prokopyev. Optimization Letters Best Paper Award
3 -- 10Cédric Josz, Didier Henrion. Strong duality in Lasserre's hierarchy for polynomial optimization
11 -- 17Michael Orlitzky, M. Seetharama Gowda. An improved bound for the Lyapunov rank of a proper cone
19 -- 31Carlos J. Luz. A characterization of the weighted Lovász number based on convex quadratic programming
33 -- 45Belma Yelbay, S. Ilker Birbil, Kerem Bülbül, Hasan M. Jamil. Approximating the minimum hub cover problem on planar graphs
47 -- 62César Gutiérrez, Bienvenido Jiménez, Vicente Novo, Gabriel Ruiz Garzón. Vector critical points and efficiency in vector optimization with Lipschitz functions
63 -- 76Nooshin Movahedian. Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings
77 -- 88Wei Li, Pengzhen Liu, Haohao Li. Checking weak optimality of the solution to interval linear program in the general form
89 -- 108Zümbül Atan, Martine Rousseau. Inventory optimization for perishables subject to supply disruptions
109 -- 118Jianming Dong, Jueliang Hu, Guohui Lin. A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines
119 -- 136Yang Zhang, Bin Dan. An efficient adaptive scaling parameter for the spectral conjugate gradient method
137 -- 158Rouhollah Tavakoli. On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs N-simplex
159 -- 168Wenjie Li, Jinjiang Yuan. LPT online strategy for parallel-machine scheduling with kind release times
169 -- 180Enrico Malaguti, Rosa Medina Durán, Paolo Toth. A metaheuristic framework for Nonlinear Capacitated Covering Problems
181 -- 188Amin Dehghanian, Andrew J. Schaefer. Superadditive characterizations of pure integer programming feasibility
189 -- 205Christian Blum, Günther R. Raidl. Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
207 -- 213Taibo Luo, Yin-Feng Xu. Optimal algorithm for semi-online scheduling on two machines under GoS levels