default search action
Optimization Letters, Volume 15
Volume 15, Number 1, February 2021
- Pavlo A. Krokhmal, Oleg A. Prokopyev
:
Optimization Letters Best Paper Award for 2019. 1-2 - Yohann de Castro
Dual optimal design and the Christoffel-Darboux polynomial. 3-8 - Miguel F. Anjos
Mathematical optimization approach for facility layout on several rows. 9-23 - Daniel Woolnough, Vaithilingam Jeyakumar, Guoyin Li:
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. 25-44 - Chayne Planiden
Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness. 45-57 - Gustavo de Araujo Sabry
Models and linearizations for the Traveling Car Renter with Passengers. 59-81 - Adil M. Bagirov, Sona Taheri
Aggregate subgradient method for nonsmooth DC optimization. 83-96 - Wissem Achour, Djamal Chaabane, Víctor Blanco
An improved algorithm to compute the ømega-primality. 97-107 - Yanchao Liu
A note on solving DiDi's driver-order matching problem. 109-125 - Horst Alzer, Man Kam Kwong, Gradimir V. Milovanovic
On the zeros of lacunary-type polynomials. 127-136 - Dmitriy S. Malyshev, Olga O. Razvenskaya, Panos M. Pardalos:
The computational complexity of weighted vertex coloring for P5, K2, 3, K+2, 3-free graphs. 137-152 - Armando Teles Dauer
Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows. 153-170 - Vo Si Trong Long:
A new notion of error bounds: necessary and sufficient conditions. 171-188 - Hui Zhang, Lili Pan, Naihua Xiu:
Optimality conditions for locally Lipschitz optimization with l0-regularization. 189-203 - Dang Van Hieu, Abdellatif Moudafi:
Regularization projection method for solving bilevel variational inequality problem. 205-229 - Samir Elhedhli, Fatma Gzara, Cynthia Waltho:
Green supply chain design with emission sensitive demand: second order cone programming formulation and case study. 231-247 - Yuan Gao, Jinjiang Yuan, C. T. Ng
A note on competing-agent Pareto-scheduling. 249-262 - Simon Foucart:
Facilitating OWL norm minimizations. 263-269 - Eduardo Lalla-Ruiz
Mathematical formulations and improvements for the multi-depot open vehicle routing problem. 271-286 - Antanas Zilinskas
Review on the SpriengerBriefs monograph "deterministic global optimization: an introduction to the diagonal approach". 287-288
Volume 15, Number 2, March 2021
- Archis Ghate
Inverse conic linear programs in Banach spaces. 289-310 - Dmitriy S. Malyshev:
The vertex colourability problem for claw, butterfly-free graphs is polynomial-time solvable. 311-326 - Bismark Singh
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs. 327-336 - Jean Paulo Martins
A randomized heuristic repair for the multidimensional knapsack problem. 337-355 - Zsolt Darvay
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation. 357-376 - Yun Hui Lin
Exact approaches for competitive facility location with discrete attractiveness. 377-389 - Diana C. Montañés, Adolfo J. Quiroz, Mateo Dulce Rubio, Alvaro Riascos
Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces. 391-404 - Felix Lieder
On the convergence rate of the Halpern-iteration. 405-418 - Chang Liang, Yuning Yang
A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors. 419-429 - Maksim Barketau:
Evaluation of solution of discrete optimization problem with incomplete input. 431-440 - Li Chu, Bo Wang
The rate of convergence of proximal method of multipliers for second-order cone optimization problems. 441-457 - Evren Olcaytu
An efficient bidding heuristic for simultaneous truckload transportation auctions. 459-468 - Baoyu Liao, Haoxin Wang, Xing Zhu, Shanlin Yang, Panos M. Pardalos:
Improved DE search for competing groups scheduling with deterioration effects. 469-494 - Xiaoxi Zhu, Miaomiao Wang
Optimal pricing strategy of a hybrid trade old for new and remanufactured products supply chain. 495-511 - Guoqiang Wang, He Luo
Communication topology optimization for three-dimensional persistent formation with leader constraint. 513-535 - Shaojun Lu, Xinbao Liu, Jun Pei, Panos M. Pardalos:
Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines. 537-551 - Bayi Cheng, Huijun Zhu, Bo-hai Liu, Minglun Ren:
Minmizing service span with batch-position-based learning effects. 553-567 - Xiaonong Lu, Zhanglin Peng, Qiang Zhang, Shanlin Yang:
Event-based optimization approach for solving stochastic decision problems with probabilistic constraint. 569-590 - Qiang Zhang, Zhanglin Peng
An adaptive agent-based process model for optimizing innovative design. 591-612 - Lam Quoc Anh, Pham Thanh Duoc, Tran Ngoc Tam, N. C. Thang:
Stability analysis for set-valued equilibrium problems with applications to Browder variational inclusions. 613-626 - Pham Ngoc Anh
New projection methods for equilibrium problems over fixed point sets. 627-648 - Maciej Drwal
Robust approach to restricted items selection problem. 649-667 - Jianping Li
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${\mathbb {R}}^2$. 669-683 - Zishen Yang, Majun Shi, Wei Wang:
Greedy approximation for the minimum connected dominating set with labeling. 685-700 - Pascal Bianchi, Walid Hachem, Adil Salim
A fully stochastic primal-dual algorithm. 701-710 - Rentsen Enkhbat
Optimization approach to Berge equilibrium for bimatrix game. 711-718 - Nguyen Nang Tam, Tran Van Nghi:
On the solution existence to convex polynomial programs and its applications. 719-731 - Taibo Luo, Hongmei Li, Shaofeng Ru, Weitian Tong, Yinfeng Xu:
Multiple sink location problem in path networks with a combinational objective. 733-755 - Duong Viet Thong, Xiao-Huan Li, Qiao-Li Dong, Yeol Je Cho, Themistocles M. Rassias:
An inertial Popov's method for solving pseudomonotone variational inequalities. 757-777 - Rafal Kamocki
Existence of optimal solutions to Lagrange problems for ordinary control systems involving fractional Laplace operators. 779-801 - Jesus O. Cunha
On the computational complexity of uncapacitated multi-plant lot-sizing problems. 803-812
Volume 15, Number 3, April 2021
- Samir Adly
Special issue on variational analysis, optimization and their applications. 813-815 - Monica Bianchi, Igor V. Konnov, Rita Pini
Limit vector variational inequalities and market equilibrium problems. 817-832 - Poonam Kesarwani, Joydeep Dutta
Charnes-Cooper scalarization and convex vector optimization. 833-846 - Bahareh Khazayel, Ali P. Farajzadeh
New vectorial versions of Takahashi's nonconvex minimization problem. 847-858 - Iván Aguirre-Cipe, Rubén López
A study of interval optimization problems. 859-877 - Ouayl Chadli, Gábor Kassay
On the existence of antiperiodic solutions for hemivariational inequalities: an equilibrium problem approach. 879-900 - Qamrul Hasan Ansari
Proximal point algorithm for inclusion problems in Hadamard manifolds with applications. 901-921 - Majid Fakhar, M. Lotfipour
Abstract convexity in KKM theorems via set-valued maps. 923-931 - Dang Van Cuong, Boris S. Mordukhovich, Nguyen Mau Nam:
Quasi-relative interiors for graphs of convex set-valued mappings. 933-952 - F. Bazargan, H. Mohebi:
New qualification conditions for convex optimization without convex representation. 953-977 - Suliman Al-Homidan, Loai Shaalan
Approximation of quasiconvex functions by neatly quasiconvex functions. 979-989 - Jorge Amaya, Cristopher Hermosilla
Optimality conditions for the continuous model of the final open pit problem. 991-1007 - Salman Khodayifar:
Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle. 1009-1026
Volume 15, Number 4, June 2021
- Thomas Kleinert, Martine Labbé, Fränk Plein, Martin Schmidt
Closing the gap in linear bilevel optimization: a new valid primal-dual inequality. 1027-1040 - Viet Hung Nguyen
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results. 1041-1060 - Mahsa Moghaddass, Daria Terekhov
Inverse integer optimization with multiple observations. 1061-1079 - Ningji Wei
A resiliency analysis of information distribution policies over mobile ad hoc networks. 1081-1103 - Chenfei Hou, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
An approximation algorithm for the submodular multicut problem in trees with linear penalties. 1105-1112 - Hongzhi Wei
Vector network equilibrium problems with uncertain demands and capacity constraints of arcs. 1113-1131 - Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
A loopless algorithm for generating (k, m)-ary trees in Gray code order. 1133-1154 - Hailing Liu, Xiwen Lu
A best possible online algorithm for parallel batch scheduling with delivery times and limited restart. 1155-1173 - Tran Van Su
Strong Karush-Kuhn-Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials. 1175-1194 - Jaeyoong Lim, Sungsoo Park
On using cardinality constrained uncertainty for objective coefficients in robust optimization. 1195-1214 - El Houcine Bergou, Youssef Diouane
Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure. 1215-1227 - Li Guan, Weidong Li
Online algorithms for the mixed ring loading problem with two nodes. 1229-1239 - C. L. Yao, J. W. Chen:
Vector conjugation and subdifferential of vector topical function in complete lattice. 1241-1261 - Bruno Dinis
On the convergence of algorithms with Tikhonov regularization terms. 1263-1276 - Patrick Mehlitz
A note on partial calmness for bilevel optimization problems with linearly structured lower level. 1277-1291 - Stefan Kober
Improved lower bound on the dimension of the EU council's voting rules. 1293-1302 - Tomohiko Mizutani:
Improved analysis of spectral algorithm for clustering. 1303-1325 - Settar Mustu
The single machine scheduling problem with setup times under an extension of the general learning and forgetting effects. 1327-1343 - Bruno Costa e Silva Nogueira
Iterated local search for the generalized independent set problem. 1345-1369 - Josep Freixas
A characterization of weighted simple games based on pseudoweightings. 1371-1383 - Giorgio Zucchi
Personnel scheduling during Covid-19 pandemic. 1385-1396 - Adil I. Erzin
FPTAS for barrier covering problem with equal touching circles in 2D. 1397-1406 - André Renato Sales Amaral:
A mixed-integer programming formulation of the double row layout problem based on a linear extension of a partial order. 1407-1423 - Saeid Ansary Karbasy, Abdelouahed Hamdi
An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints. 1425-1446 - Ilya Minarchenko
On minimization of a quadratic function with one negative eigenvalue. 1447-1455 - Gang Cai
Strong convergence theorems for inertial Tseng's extragradient method for solving variational inequality problems and fixed point problems. 1457-1474 - Jiawen Gao, Suogang Gao, Wen Liu, Weili Wu, Ding-Zhu Du, Bo Hou:
An approximation algorithm for the k-generalized Steiner forest problem. 1475-1483 - Stuart M. Harwood
A note on semi-infinite program bounding methods. 1485-1490 - Michael R. Metel, Akiko Takeda:
Primal-dual subgradient method for constrained convex optimization problems. 1491-1504 - Bismark Singh
Correction to: Fairness criteria for allocating scarce resources. 1505
Volume 15, Number 5, July 2021
- Patrizia Daniele
Preface. 1507-1508 - Avelina Alejo-Reyes, Abraham Mendoza
Inventory replenishment decisions model for the supplier selection problem facing low perfect rate situations. 1509-1535 - Qamrul Hasan Ansari
A limiting subdifferential version of Ekeland's variational principle in set optimization. 1537-1551 - Edoardo Bastianetto, Sara Ceschia
Solving a home energy management problem by Simulated Annealing. 1553-1564 - Patrizia Beraldi, Annarita De Maio
A pick-up and delivery problem for logistics e-marketplace services. 1565-1577 - Luca Bertazzi
Direct k-routing versus cross-docking: worst-case results. 1579-1586 - Francesco Carrabs
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. 1587-1600 - Gabriella Colajanni
A new model for curriculum-based university course timetabling. 1601-1616 - Mauro Dell'Amico, Roberto Montemanni
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. 1617-1648 - Alberto De Santis, Umberto Dellepiane, Stefano Lucidi
A derivative-free optimization approach for the autotuning of a Forex trading strategy. 1649-1664 - Gianni Di Pillo
Cruise itineraries optimal scheduling. 1665-1689 - Georgia Fargetta
Generalized Nash equilibrium and dynamics of popularity of online contents. 1691-1709 - Giorgio Gnecco
On the trade-off between number of examples and precision of supervision in machine learning problems. 1711-1733 - Wei-Bo Guan
The forward-backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces. 1735-1758 - Liguo Jiao
Quasi ε-solutions in a semi-infinite programming problem with locally Lipschitz data. 1759-1772 - Igor Konnov
Application of the penalty method to limit quasi-equilibrium problems. 1773-1783 - Francesco Mezzadri
A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems. 1785-1798 - Mauro Passacantando
Optimal road maintenance investment in traffic networks with random demands. 1799-1819 - Constantin Udriste
Multitime hybrid differential games with multiple integral functional. 1821-1834
Volume 15, Number 6, September 2021
- Jean B. Lasserre
The moment-SOS hierarchy and the Christoffel-Darboux kernel. 1835-1845 - Akang Wang
Mixed-integer linear optimization for full truckload pickup and delivery. 1847-1863 - Linas Stripinis
A new DIRECT-GLh algorithm for global optimization with hidden constraints. 1865-1884 - Massimiliano Caramia
Maximizing recyclable materials and user utility in waste collection: a linear-quadratic bilevel optimization approach. 1885-1904 - Mathieu Lacroix
Efficient formulations for the traveling car renter problem and its quota variant. 1905-1930 - Shen Peng
Games with distributionally robust joint chance constraints. 1931-1953 - Adil I. Erzin
Two-Bar Charts Packing Problem. 1955-1971 - Daniele Ferone, Paola Festa, Serena Fugaro
A dynamic programming algorithm for solving the k-Color Shortest Path Problem. 1973-1992 - Sandi Klavzar, Mostafa Tavakoli:
Edge metric dimensions via hierarchical product and integer linear programming. 1993-2003 - Calogero Orlando
Analytic solution of the continuous particle swarm optimization problem. 2005-2015 - Shi-Liang Wu, Shu-Qian Shen:
On the unique solution of the generalized absolute value equation. 2017-2024 - Bo Xu, Bo Wen:
On the convergence of a class of inertial dynamical systems with Tikhonov regularization. 2025-2052 - Lu Han, Dachuan Xu
An approximation algorithm for the k-level facility location problem with outliers. 2053-2065 - Anubha Goel
Robust Omega ratio optimization using regular vines. 2067-2108 - Yekini Shehu
New inertial relaxed method for solving split feasibilities. 2109-2126 - Akhtar A. Khan, Miguel Sama:
Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories. 2127-2145 - Yuncheng Liu, Fuquan Xia
Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization. 2147-2164 - Xiaofei Liu
Approximation algorithms for the multiprocessor scheduling with submodular penalties. 2165-2180 - Duong Viet Thong, Jun Yang, Yeol Je Cho, Themistocles M. Rassias:
Explicit extragradient-like method with adaptive stepsizes for pseudomonotone variational inequalities. 2181-2199 - Vo Duc Thinh
Second order variational analysis of disjunctive constraint sets and its applications to optimization problems. 2201-2224 - Mohammad Hossein Alizadeh:
On generalized convex functions and generalized subdifferential II. 2225-2240 - Moslem Zamani
A new concave minimization algorithm for the absolute value equation solution. 2241-2254 - Andrei Patrascu
Stochastic proximal splitting algorithm for composite minimization. 2255-2273 - Omar Jorge Ibarra-Rojas
Vehicle routing problem considering equity of demand satisfaction. 2275-2297 - Diego Cifuentes
On the Burer-Monteiro method for general semidefinite programs. 2299-2309 - Dan-Yang Lv, Ji-Bo Wang:
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. 2311-2319 - Martin Frohn
On the approximability of the fixed-tree balanced minimum evolution problem. 2321-2329 - Milan Hladík
A new polynomially solvable class of quadratic optimization problems with box constraints. 2331-2341 - Fani Boukouvala
Correction to: A preface to the special issue in memory of Professor Christodoulos A. Floudas. 2343 - Patrizia Daniele
Correction to: Preface. 2345
Volume 15, Number 7, October 2021
- Hoai An Le Thi
Preface to the special issue dedicated to the 6th World Congress on Global Optimization held in Metz, France, July 8-10, 2019. 2347-2349 - Abdelouafi Ghazi, Ahmed Roubi:
Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions. 2351-2375 - Thi Thuy Tran
DC programming and DCA for enhancing physical layer security via relay beamforming strategies. 2377-2405 - Yi-Shuai Niu
A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model. 2407-2432 - Joanna Berlinska
Two-machine flow shop with dynamic storage space. 2433-2454 - Marco Cococcioni
The Big-M method with the numerical infinite M. 2455-2468 - Victor Gergel, Evgeniy Kozinov
Computationally efficient approach for solving lexicographic multicriteria optimization problems. 2469-2495 - Shapour Heidarkhani, Shahin Moradi, Giuseppe Caristi:
Existence results for a dynamic Sturm-Liouville boundary value problem on time scales. 2497-2514 - Milan Hladík
Maximization of a PSD quadratic form and factorization. 2515-2528
Volume 15, Number 8, November 2021
- Ulrich Pferschy, Joachim Schauer
Approximating the product knapsack problem. 2529-2540 - Afrooz Jalilzadeh:
Primal-dual incremental gradient method for nonsmooth and convex optimization problems. 2541-2554 - Hongtan Sun, Thomas C. Sharkey
Decentralized scheduling with precedence constraints. 2555-2575 - Mina Aliakbari, Joseph Geunes
The single train shortest route problem in a railyard. 2577-2595 - Mathieu Besançon, Miguel F. Anjos
Complexity of near-optimal robust versions of multilevel optimization problems. 2597-2610 - Fatma Tevhide Altekin
Linear and conic reformulations for the maximum capture location problem under multinomial logit choice. 2611-2637 - Hao Wang, Hao Zeng, Jiashan Wang, Qiong Wu:
Relating ℓ p regularization and reweighted ℓ 1 regularization. 2639-2660 - Qiao Zhang, Xiucui Guan
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance. 2661-2680 - Nizare Riane
Optimization on fractal sets. 2681-2700 - Yang Xu, Zheng-Hai Huang
Bounds of the solution set of the tensor complementarity problem. 2701-2718 - Goran Banjac
On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization. 2719-2732 - M. Hoffhues, Werner Römisch, Thomas M. Surowiec
On quantitative stability in infinite-dimensional optimization under uncertainty. 2733-2756 - Utkan Onur Candogan, Yong Sheng Soh, Venkat Chandrasekeran:
A note on convex relaxations for the inverse eigenvalue problem. 2757-2772 - Alexander V. Fominyh
The quasidifferential descent method in a control problem with nonsmooth objective functional. 2773-2792 - Jeremy D. Jordan, Stan Uryasev:
Shortest path network problems with stochastic arc weights. 2793-2812 - Maurizio Bruglieri
A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations. 2813-2829 - Shummin Nakayama
On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression. 2831-2860 - Samir Adly, Ba Khiet Le:
Douglas-Rachford splitting algorithm for solving state-dependent maximal monotone inclusions. 2861-2878 - Pablo Soares
t-Linearization for the maximum diversity problem. 2879-2895 - Yaroslav D. Sergeyev:
Review on the book Anatoly Zhigljavsky, Antanas Žilinskas "Bayesian and High-Dimensional Global Optimization", SpringerBriefs in Optimization, Springer, 2021. 2897-2899
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: