Optimization Letters, Volume 14

Volume 14, Number 1, February 2020

• 
  Pavlo A. Krokhmal, Oleg A. Prokopyev:
  Optimization Letters Best Paper Award for 2018. 1
• 
  Charles Audet, Pascal Côté, Catherine Poissant, Christophe Tribes:
  Monotonic grey box direct search optimization. 3-18
• 
  Manlio Gaudioso, Enrico Gorgone, Jean-Baptiste Hiriart-Urruty:
  Feature selection in SVM via polyhedral k-norm. 19-36
• 
  Emily A. Heath, John E. Mitchell, Thomas C. Sharkey:
  Scheduling of tasks with effectiveness precedence constraints. 37-49
• 
  Riccardo Moriconi, K. S. Sesh Kumar, Marc Peter Deisenroth:
  High-dimensional Bayesian optimization with projections using quantile Gaussian processes. 51-64
• 
  Laleh Eslamizadeh, Eskandar Naraghirad:
  Existence of solutions of set-valued equilibrium problems in topological vector spaces with applications. 65-83
• 
  Massimiliano Caramia, Stefano Giordani:
  Location of differentiated waste collection centers with user cooperation: a bilevel optimization approach. 85-99
• 
  Seulgi Joung, Kyungsik Lee:
  Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. 101-113
• 
  Duong Viet Thong, Dang Van Hieu, Themistocles M. Rassias:
  Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems. 115-144
• 
  Shu Liang, Le Yi Wang, George Yin:
  Fractional differential equation approach for convex optimization with convergence rate analysis. 145-155
• 
  Mohammad Hossein Alizadeh:
  On generalized convex functions and generalized subdifferential. 157-169
• 
  Amin Hosseininasab, Fatma Gzara:
  Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem. 171-193
• 
  Kazuo Murota, Akihisa Tamura:
  Integrality of subgradients and biconjugates of integrally convex functions. 195-208
• 
  Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou:
  Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach. 209-227
• 
  Patrick R. Johnstone, Jonathan Eckstein:
  Projective splitting with forward steps only requires continuity. 229-247
• 
  Yuezhong Zhang, Lihang Hou, Bo Hou, Weili Wu, Ding-Zhu Du, Suogang Gao:
  On the metric dimension of the folded n-cube. 249-257
• 
  James M. Calvin, Antanas Zilinskas:
  On efficiency of a single variable bi-objective optimization algorithm. 259-267

Volume 14, Number 2, March 2020

Distances in optimization and graphs dedicated to the memory of Michel Deza

• 
  Antonio Mucherino, Carlile Lavor:
  Preface: Special issue on distances in optimization and graphs dedicated to the memory of Michel Deza. 269-271
• 
  Michel Deza, Mathieu Dutour Sikiric:
  Generalized cut and metric polytopes of graphs and simplicial complexes. 273-289
• 
  Pavel Chebotarev, Elena Deza:
  Hitting time quasi-metric and its forest representation. 291-307
• 
  Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin:
  Distance between vertices of lattice polytopes. 309-326
• 
  Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin, Carlos Aníbal Suárez:
  Correction to: Distance between vertices of lattice polytopes. 327-328
• 
  Michel Petitjean:
  Chirality in metric spaces. 329-338
• 
  Monique Laurent, Shin-ichi Tanigawa:
  Perfect elimination orderings for symmetric matrices. 339-353
• 
  Alain Hertz:
  An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. 355-367
• 
  Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
  Modelling and solving the perfect edge domination problem. 369-394
• 
  Juan Carlos Figueroa-García, Miguel Alberto Melgarejo-Rey, Germán Jairo Hernández-Pérez:
  Representation of the Minkowski metric as a fuzzy set. 395-408
• 
  Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
  On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. 409-415
• 
  Jon Lee, Leo Liberti:
  On an SDP relaxation for kissing number. 417-422
• 
  Douglas Soares Gonçalves:
  A least-squares approach for discretizable distance geometry problems with inexact distances. 423-437
• 
  Jérémy Omer, Douglas Soares Gonçalves:
  An integer programming approach for the search of discretization orders in distance geometry problems. 439-452
• 
  Alain Franc, Pierre Blanchard, Olivier Coulaud:
  Nonlinear mapping and distance geometry. 453-467
• 
  Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
  The K-discretization and K-incident graphs for discretizable Distance Geometry. 469-482
• 
  Luiz Leduíno de Salles Neto, Carlile Lavor, Weldon A. Lodwick:
  A constrained interval approach to the generalized distance geometry problem. 483-492
• 
  Antonio Mucherino, Jérémy Omer, Ludovic Hoyet, Paolo Robuffo Giordano, Franck Multon:
  An application-based characterization of dynamical distance geometry problems. 493-507

Volume 14, Number 3, April 2020

• 
  Wim van Ackooij, Welington de Oliveira:
  Some brief observations in minimizing the sum of locally Lipschitzian functions. 509-520
• 
  Sumalee Sangamuang, Pruet Boonma, Juggapong Natwichai, Wanpracha Art Chaovalitwongse:
  Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking. 521-533
• 
  Guido Cocchi, Tommaso Levato, Giampaolo Liuzzi, Marco Sciandrone:
  A concave optimization-based approach for sparse multiobjective programming. 535-556
• 
  Anton V. Eremeev, Mikhail Y. Kovalyov, Pavel M. Kuznetsov:
  Lot-size scheduling of a single product on unrelated parallel machines. 557-568
• 
  Mei-Jia Yang, Yong Xia:
  On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint. 569-578
• 
  Ramon Faganello Fachini, Vinícius Amaral Armentano:
  Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. 579-609
• 
  Shan Jiang, Shu-Cherng Fang, Tiantian Nie, Qi An:
  Structured linear reformulation of binary quadratically constrained quadratic programs. 611-636
• 
  Guo-ji Tang, Yan-shu Li:
  Existence of solutions for mixed variational inequalities with perturbation in Banach spaces. 637-651
• 
  Noureddine Khimoum, Mohand Ouamer Bibi:
  Primal-dual method for solving a linear-quadratic multi-input optimal control problem. 653-669
• 
  Eduardo Lalla-Ruiz, Stefan Voß:
  A POPMUSIC approach for the Multi-Depot Cumulative Capacitated Vehicle Routing Problem. 671-691
• 
  Peiping Shen, Bingdi Huang:
  Global algorithm for solving linear multiplicative programming problems. 693-710
• 
  Qamrul Hasan Ansari, Feeroz Babu:
  Existence and boundedness of solutions to inclusion problems for maximal monotone vector fields in Hadamard manifolds. 711-727
• 
  Baha Alzalg:
  A logarithmic barrier interior-point method based on majorant functions for second-order cone programming. 729-746
• 
  Kris Boudt, Chunlin Wan:
  The effect of velocity sparsity on the performance of cardinality constrained particle swarm optimization. 747-758
• 
  Marius Durea, Radu Strugariu:
  A barrier method in convex vector optimization with generalized inequality constraints. 759-769
• 
  Baruch Mor, Gur Mosheiov:
  Minimizing total load on parallel machines with linear deterioration. 771-779
• 
  Mahdi Takalloo, Changhyun Kwon:
  Sensitivity of wardrop equilibria: revisited. 781-796

Volume 14, Number 4, June 2020

Special Issue in Memory of Professor Christodoulos A. Floudas

• 
  Fani Boukouvala, Chrysanthos E. Gounaris:
  A preface to the special issue in memory of Professor Christodoulos A. Floudas. 797-800
• 
  Francesco Ceccon, John D. Siirola, Ruth Misener:
  SUSPECT: MINLP special structure detector for Pyomo. 801-814
• 
  Ernesto G. Birgin, John Lenon Cardoso Gardenghi, José Mario Martínez, Sandra A. Santos:
  On the use of third-order models with fourth-order regularization for unconstrained optimization. 815-838
• 
  Dimitris Bertsimas, Nataly Youssef:
  Stochastic optimization in supply chain networks: averaging robust solutions. 839-855
• 
  Min Kong, Xinbao Liu, Jun Pei, Zhiping Zhou, Panos M. Pardalos:
  Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. 857-871
• 
  Styliani Avraamidou, Efstratios N. Pistikopoulos:
  Adjustable robust optimization through multi-parametric programming. 873-887
• 
  Michael J. Risbeck, Christos T. Maravelias, James B. Rawlings, Robert D. Turney:
  Mixed-integer optimization methods for online scheduling in large-scale HVAC systems. 889-924
• 
  Chrysanthos E. Gounaris, Daniel R. Schmidt:
  Generalized Hose uncertainty in single-commodity robust network design. 925-944
• 
  Yuan Yuan, Zukui Li, Biao Huang:
  Oil sands extraction plant debottlenecking: an optimization approach. 945-957
• 
  Atharv Bhosekar, Marianthi Ierapetritou:
  A discontinuous derivative-free optimization framework for multi-enterprise supply chain. 959-988
• 
  Sun Hye Kim, Fani Boukouvala:
  Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques. 989-1010
• 
  Ishan Bajaj, M. M. Faruque Hasan:
  Deterministic global derivative-free optimization of black-box problems with bounded Hessian. 1011-1026

Volume 14, Number 5, July 2020

• 
  Angeles Martinez, Federico Piazzon, Alvise Sommariva, Marco Vianello:
  Quadrature-based polynomial optimization. 1027-1036
• 
  Guanglin Xu, Alexander Semenov, Maciej Rysz:
  An integer programming formulation of the key management problem in wireless sensor networks. 1037-1051
• 
  Mounir Haddou, Tangi Migot:
  A smoothing method for sparse optimization over convex sets. 1053-1069
• 
  Cesare Molinari, Juan Peypouquet, Fernando Roldán:
  Alternating forward-backward splitting for linearly constrained optimization problems. 1071-1088
• 
  La Huang, Jiawei Chen:
  Weighted robust optimality of convex optimization problems with data uncertainty. 1089-1105
• 
  Jack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
  A non-triangular hub location problem. 1107-1126
• 
  Nithirat Sisarat, Rabian Wangkeeree:
  Characterizing the solution set of convex optimization problems without convexity of constraints. 1127-1144
• 
  Mohammad A. Raayatpanah, Hossein Moosaei, Panos M. Pardalos:
  Absolute value equations with uncertain data. 1145-1156
• 
  Duong Viet Thong, Nguyen The Vinh, Yeol Je Cho:
  A strong convergence theorem for Tseng's extragradient method for solving variational inequality problems. 1157-1175
• 
  Trinh Ngoc Hai:
  On gradient projection methods for strongly pseudomonotone variational inequalities without Lipschitz continuity. 1177-1191
• 
  Minh N. Dao, Hung M. Phan:
  Computing the resolvent of the sum of operators with application to best approximation problems. 1193-1205
• 
  Roberto Tadei, Guido Perboli, Daniele Manerba:
  The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities. 1207-1218
• 
  Ondrej Osicka, Mario Guajardo, Kurt Jörnsten:
  Cooperation of customers in traveling salesman problems with profits. 1219-1233
• 
  Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang:
  Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. 1235-1248
• 
  Zhiping Chen, Jie Jiang:
  Quantitative stability of fully random two-stage stochastic programs with mixed-integer recourse. 1249-1264
• 
  Amir Ahmadi-Javid, Nasrin Ramshe:
  Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application. 1265-1285
• 
  Amir Ahmadi-Javid, Nasrin Ramshe:
  Correction to: Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application. 1287

Volume 14, Number 6, September 2020

• 
  Jonathan Eckstein:
  Deriving solution value bounds from the ADMM. 1289-1303
• 
  Warren L. Hare, Gabriel Jarry-Bolduc:
  A deterministic algorithm to compute the cosine measure of a finite positive spanning set. 1305-1316
• 
  Dmitry B. Mokeev, Dmitriy S. Malyshev:
  A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs. 1317-1322
• 
  Trivikram Dokka, Marc Goerigk, Rahul Roy:
  Mixed uncertainty sets for robust combinatorial optimization. 1323-1337
• 
  Pedro J. Villasana T., Stanislaw Gorlow, Arvind T. Hariraman:
  Multiplicative updates for convolutional NMF under β-divergence. 1339-1352
• 
  Abdellah Bnouhachem, Themistocles M. Rassias:
  On descent alternating direction method with LQP regularization for the structured variational inequalities. 1353-1369
• 
  Shinya Fujita:
  Optimal proper connection of graphs. 1371-1380
• 
  Nazih Abderrazzak Gadhi, Stephan Dempe, Mohammed El Idrissi:
  New optimality conditions for bilevel programs by using an exact separation principle. 1381-1392
• 
  Xide Zhu, Peijun Guo:
  Single-level reformulations of a specific non-smooth bilevel programming problem and their applications. 1393-1406
• 
  Gabriel Jarry-Bolduc, Patrick Nadeau, Shambhavi Singh:
  Uniform simplex of an arbitrary orientation. 1407-1417
• 
  Kai Zhang, Xiaoqi Yang:
  A power penalty method for discrete HJB equations. 1419-1433
• 
  Maryam Yashtini:
  Euler's elastica-based algorithm for Parallel MRI reconstruction using SENSitivity Encoding. 1435-1458
• 
  Alexander E. I. Brownlee, Jerry Swan, Richard Senington, Zoltan A. Kocsis:
  Conflict-free routing of multi-stop warehouse trucks. 1459-1470
• 
  Joel Chacón Castillo, Carlos Segura:
  Differential evolution with enhanced diversity maintenance. 1471-1490
• 
  Mehmet Önal, O. Erhun Kundakcioglu, Smita Jain:
  An EOQ model with deteriorating items and self-selection constraints. 1491-1518
• 
  Rovshan A. Bandaliyev, Ilgar G. Mamedov, Misir J. Mardanov, Telman K. Melikov:
  Fractional optimal control problem for ordinary differential equation in weighted Lebesgue spaces. 1519-1532
• 
  Bismark Singh:
  Fairness criteria for allocating scarce resources. 1533-1541
• 
  Ludwig Kampel, Manuel Leithner, Dimitris E. Simos:
  Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm. 1543-1556
• 
  Amit Verma, Mark W. Lewis:
  Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions. 1557-1569
• 
  Jing Wang, Zheng-Hai Huang, Yang Xu:
  Existence and uniqueness of solutions of the generalized polynomial variational inequality. 1571-1582
• 
  Youngsuk Park, Ernest K. Ryu:
  Linear convergence of cyclic SAGA. 1583-1598
• 
  Yule Zhang, Jia Wu, Liwei Zhang:
  The rate of convergence of proximal method of multipliers for equality constrained optimization problems. 1599-1613

Volume 14, Number 7, October 2020

• 
  Andrzej Ruszczynski:
  Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization. 1615-1625
• 
  Archis Ghate:
  Robust continuous linear programs. 1627-1642
• 
  Akshay Agrawal, Stephen P. Boyd:
  Disciplined quasiconvex programming. 1643-1657
• 
  Charis Ntakolia, Hernan Caceres, John Coletsos:
  A dynamic integer programming approach for free flight air traffic management (ATM) scenario with 4D-trajectories and energy efficiency aspects. 1659-1680
• 
  Shi-Sheng Li, Ren-Xia Chen:
  Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties. 1681-1699
• 
  Zhihao Chen, Zhao Zhang, Yingli Ran, Yishuo Shi, Ding-Zhu Du:
  Data mule scheduling on a path with handling time and time span constraints. 1701-1710
• 
  Xiang-Kai Sun, Kok Lay Teo, Jing Zeng, Xiao-Le Guo:
  On approximate solutions and saddle point theorems for robust convex optimization. 1711-1730
• 
  Youcheng Lou:
  Some properties of the optimal investment strategy in a behavioral portfolio choice model. 1731-1746
• 
  Zsolt Darvay, Behrouz Kheirfam, Petra Renáta Rigó:
  A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. 1747-1763
• 
  Stephan Dempe, Nazih Abderrazzak Gadhi, Khadija Hamdaoui:
  Minimizing the difference of two quasiconvex functions. 1765-1779
• 
  Zhao Deng, Sanyang Liu:
  Generalized Peaceman-Rachford splitting method with substitution for convex programming. 1781-1802
• 
  Jun Yang, Hongwei Liu:
  The subgradient extragradient method extended to pseudomonotone equilibrium problems and fixed point problems in Hilbert space. 1803-1816
• 
  Dang Van Hieu, Aviv Gibali:
  Strong convergence of inertial algorithms for solving equilibrium problems. 1817-1843
• 
  Yoshihiro Kanno:
  An accelerated Uzawa method for application to frictionless contact problem. 1845-1854
• 
  Zhibin Deng, Cheng Lu, Ye Tian, Jian Luo:
  Globally solving extended trust region subproblems with two intersecting cuts. 1855-1867
• 
  Byung-Cheon Choi, Jibok Chung, Myoung-Ju Park:
  A just-in-time scheduling problem with two competing agents. 1869-1886
•