default search action
Optimization Letters, Volume 11
Volume 11, Number 1, January 2017
- Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award for 2015. 1-2 - Pietro Belotti
, Timo Berthold:
Three ideas for a feasibility pump for nonconvex MINLP. 3-15 - Mikita Hradovich, Adam Kasperski
The recoverable robust spanning tree problem with interval costs is polynomially solvable. 17-30 - Alexandre Dolgui
Knapsack problem with objective value gaps. 31-39 - Quyen Ho:
Necessary and sufficient KKT optimality conditions in non-convex optimization. 41-46 - Franklin Djeumou Fomeni:
A new family of facet defining inequalities for the maximum edge-weighted clique problem. 47-54 - Hui Zhang, Lizhi Cheng:
Projected shrinkage algorithm for box-constrained ℓ1-minimization. 55-70 - Xipeng Kou, Shengjie Li:
On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities. 71-80 - Razak Alli-Oke
A secant-based Nesterov method for convex functions. 81-105 - Satoshi Suzuki, Daishi Kuroiwa:
Nonlinear error bounds for quasiconvex inequality systems. 107-120 - Narges Norouzi, Mohsen Sadegh Amal Nick, Reza Tavakkoli-Moghaddam
Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption. 121-134 - Ximei Yang, Hongwei Liu, Yinkui Zhang:
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. 135-152 - Kyungchul Park, Kyungsik Lee:
Distribution-robust loss-averse optimization. 153-163 - Alexander A. Lazarev, Dmitry I. Arkhipov
Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan. 165-177 - Wim van Ackooij
Second-order differentiability of probability functions. 179-194 - Alessandro Galligari
Local search heuristics for the zone planning problem. 195-207 - Chien-Hao Huang, Jein-Shan Chen, Juan Enrique Martínez-Legaz
Differentiability v.s. convexity for complementarity functions. 209-216 - Shuaian Wang
A note on ship routing between ports. 217-223 - Sachin Jayaswal
A cutting plane approach to combinatorial bandwidth packing problem with queuing delays. 225-239 - Boris S. Mordukhovich:
Book Review "optimization and its applications in control and data sciences: in honor of Boris T. Polyak's 80th birthday". 241-245
Volume 11, Number 2, February 2017
- Panos M. Pardalos, Valeriy A. Kalyagin
Preface to the special issue on "Clustering and search techniques in large scale networks". 247 - Andrei M. Raigorodskii:
Small subgraphs in preferential attachment networks. 249-257 - Algirdas Lancinskas
Improving solution of discrete competitive facility location problems. 259-270 - Taibo Luo, Yuqing Zhu, Weili Wu, Yin-Feng Xu, Ding-Zhu Du:
Online makespan minimization in MapReduce-like systems with complex reduce tasks. 271-277 - Liudmila Ostroumova Prokhorenkova
General results on preferential attachment and clustering coefficient. 279-298 - Marco Viola
A generalized eigenvalues classifier with embedded feature selection. 299-311 - Jack Brimberg, Nenad Mladenovic
A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. 313-327 - Andrey V. Savchenko
Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases. 329-341 - Pablo San Segundo
A parallel maximum clique algorithm for large and massive sparse graphs. 343-358 - Alexey Nikolaev
J-means and I-means for minimum sum-of-squares clustering on networks. 359-376 - Jack Brimberg, Nenad Mladenovic
General variable neighborhood search for the uncapacitated single allocation p-hub center problem. 377-388 - Emre Tokgöz, Theodore B. Trafalis
2-Facility manifold location routing problem. 389-405 - Konstantinos Papalamprou, Leonidas S. Pitsoulis:
k-Sum decomposition of strongly unimodular matrices. 407-418 - Guangmo Tong, Weili Wu, Panos M. Pardalos, Ding-Zhu Du:
On positive-influence target-domination. 419-427 - Hossein Ghasvari
A robust optimization approach for multicast network coding under uncertain link costs. 429-444
Volume 11, Number 3, March 2017
- David Avis, Hans Raj Tiwary
On the ℋ-free extension complexity of the TSP. 445-455 - Jose Torres-Jimenez
A two-stage algorithm for combinatorial testing. 457-469 - Ziyan Luo, Liqun Qi
The sparsest solutions to Z-tensor complementarity problems. 471-482 - Ji-hong Zhang, Xi Chen, Xiao-song Ding:
Degeneracy removal in cutting plane methods for disjoint bilinear programming. 483-495 - Renato De Leone
Optimization of power production and costs in microgrids. 497-520 - S. Khoshkhabar-amiranloo, Esmaile Khorram
Nonlinear scalarization functions and polar cone in set optimization. 521-535 - Bui Van Dinh
Extragradient algorithms for equilibrium problems and symmetric generalized hybrid mappings. 537-553 - Ahmad Kamandi
An improved adaptive trust-region algorithm. 555-569 - Firmin Andzembe Okoubi, Jonas Koko:
Parallel Nesterov's method for large-scale minimization of partially separable functions. 571-581 - Jiaxin Xie, An-ping Liao, Xiaobo Yang:
An inexact alternating direction method of multipliers with relative error criteria. 583-596 - Etienne de Klerk
On the convergence rate of grid search for polynomial optimization over the simplex. 597-608 - Andrei Patrascu
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization. 609-626 - Walaa Khalaf
A DC optimization-based clustering technique for edge detection. 627-640 - Qingjie Hu, Jiguang Wang, Yu Chen, Zhibin Zhu:
On an l1 exact penalty result for mathematical programs with vanishing constraints. 641-653
Volume 11, Number 4, April 2017
- Jussi Laitila
New performance guarantees for the greedy maximization of submodular set functions. 655-665 - Eva M. García-Nové, Javier Alcaraz
Rank aggregation in cyclic sequences. 667-678 - Xingyin Wang, Stefan Poikonen, Bruce L. Golden:
The vehicle routing problem with drones: several worst-case results. 679-697 - Ramses Sala
Global optimization test problems based on random field composition. 699-713 - An Zhang, Feilang Ye, Yong Chen, Guangting Chen:
Better permutations for the single-processor scheduling with time restrictions. 715-724 - Mahmoud Masoud
A new constraint programming approach for optimising a coal rail system. 725-738 - Fabrizio Morlando:
Adjoint-based sensitivity analysis by panel methods and CAS. 739-752 - Huy Nguyen
A computational approach to determine damage in infrastructure networks from outage reports. 753-770 - Joaquin Fernandez Tapia:
Statistical modeling of Vickrey auctions and applications to automated bidding strategies. 771-780 - Sel Özcan
An alternative MILP model for makespan minimization on assembly lines. 781-799 - Tao Sun, Lizhi Cheng:
Convergence of iterative hard-thresholding algorithm with continuation. 801-815 - Hui Zhang:
The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth. 817-833 - Andrea Caliciotti
Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods. 835-853 - Gino Loyola:
Alternative equilibria in two-period ultimatum bargaining with envy. 855-874 - Vedran Kojic
Solving the consumer's utility-maximization problem with CES and Cobb-Douglas utility function via mathematical inequalities. 875-884 - Alessandro Agnetis, Gur Mosheiov:
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. 885-892
Volume 11, Number 5, June 2017
- Panos M. Pardalos:
Preface to the special issue dedicated to the 2015 World Congress on Global Optimization. 893 - Fani Boukouvala
ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems. 895-913 - Talayeh Razzaghi
Constraint relaxation, cost-sensitive learning and bagging for imbalanced classification problems with outliers. 915-928 - Athanasia Karakitsiou, Athanasios Migdalas:
Locating facilities in a competitive environment. 929-945 - Huan Gao, Hai-Bin Zhang, Zhibao Li, Emmanuel M. Tadjouddine:
A nonmonotone inexact Newton method for unconstrained optimization. 947-965 - Eric Newby, M. Montaz Ali
Linear transformation based solution methods for non-convex mixed integer quadratic programs. 967-981 - Yishui Wang, Dachuan Xu
An approximation algorithm for the nth power metric facility location problem with linear penalties. 983-993 - Zhiping Zhou, Xinbao Liu, Jun Pei, Panos M. Pardalos, Lin Liu, Chao Fu:
Real options approach to explore the effect of organizational change on IoT development project. 995-1011 - Ximing Wang, Neng Fan, Panos M. Pardalos:
Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines. 1013-1024
Volume 11, Number 6, August 2017
- Nenad Mladenovic
Preface of special issue BALCOR. 1025-1027 - Andreea Madalina Stancu, Ioan M. Stancu-Minasian:
Sufficient efficiency criteria in multiobjective fractional programming with generalized (F, b, ϕ, ρ, θ)-univex n -set functions. 1029-1045 - Raca Todosijevic
A general variable neighborhood search variants for the travelling salesman problem with draft limits. 1047-1056 - Nebojsa Nikolic
Symmetry properties of resolving sets and metric bases in hypercubes. 1057-1067 - Jesús Sánchez-Oro, Nenad Mladenovic
General Variable Neighborhood Search for computing graph separators. 1069-1089 - Abdessamad Ait El Cadi
New MIP model for multiprocessor scheduling problem with communication delays. 1091-1107 - Raca Todosijevic
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. 1109-1121 - Jack Brimberg, Stefana Janicijevic, Nenad Mladenovic
Solving the clique partitioning problem as a maximally diverse grouping problem. 1123-1135 - Lena S. Dordevic
A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints. 1137-1154 - Zorica Drazic, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
A metaheuristic approach to the dominating tree problem. 1155-1167 - Stefan Miskovic, Zorica Stanimirovic
Solving the robust two-stage capacitated facility location problem with uncertain transportation costs. 1169-1184
Volume 11, Number 7, October 2017
- Etienne de Klerk
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. 1185-1199 - Boris S. Mordukhovich, Nguyen Mau Nam:
Extremality of convex sets with some applications. 1201-1215 - Warren L. Hare:
Compositions of convex functions and fully linear models. 1217-1227 - Wei Xia, Luis F. Zuluaga:
Completely positive reformulations of polynomial optimization problems with linear constraints. 1229-1241 - Ping Liu, Xinggao Liu:
Empirical mode decomposition-based time grid refinement optimization approach for optimal control problems. 1243-1256 - Jun Pei, Xinbao Liu, Panos M. Pardalos, Kai Li, Wenjuan Fan, Athanasios Migdalas:
Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time. 1257-1271 - Bartlomiej Przybylski
Precedence constrained parallel-machine scheduling of position-dependent jobs. 1273-1281 - Federico Pagnozzi
Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem. 1283-1292 - Peter Damaschke:
Calculating approximation guarantees for partial set cover of pairs. 1293-1302 - Mauricio Díaz, Roy H. Kwon:
Optimization of covered call strategies. 1303-1317 - Herminia I. Calvete, Lourdes del Pozo, José A. Iranzo:
The energy-constrained quickest path problem. 1319-1339 - Francesco Carrabs
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. 1341-1356 - Pooja Pandey, Abraham P. Punnen:
On a linearization technique for solving the quadratic set covering problem and variations. 1357-1370 - Luciana S. Pessoa
A biased random-key genetic algorithm for the tree of hubs location problem. 1371-1384 - Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium. 1385-1405 - Yisheng Song
Strictly semi-positive tensors and the boundedness of tensor complementarity problems. 1407-1426 - Giorgio Gnecco
Symmetry and antisymmetry properties of optimal solutions to regression problems. 1427-1442 - Wei Li, Jianghong Jin, Mengxue Xia, Haohao Li, Qi Luo:
Some properties of the lower bound of optimal values in interval convex quadratic programming. 1443-1458 - Milan Hladík
On strong optimality of interval linear programming. 1459-1468 - Olvi L. Mangasarian:
Sufficient conditions for the unsolvability and solvability of the absolute value equation. 1469-1475 - Vahid Hashemi
Reformulation of the linear program for completely ergodic MDPs with average cost criteria. 1477-1487 - Ningxiong Xu:
Optimal inventory policy for a dynamic stochastic inventory problem with order revision. 1489-1497
Volume 11, Number 8, December 2017
- Endre Boros, Khaled M. Elbassioni
A convex programming-based algorithm for mean payoff stochastic games with perfect information. 1499-1512 - Leonid Faybusovich, Takashi Tsuchiya:
Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems. 1513-1526 - Andrea Cristofari
Data filtering for cluster analysis by ℓ0-norm regularization. 1527-1546 - Samir Elhedhli, Fatma Gzara, Yi Feng Yan:
A MIP-based slicing heuristic for three-dimensional bin packing. 1547-1563 - Yongle Zhang, Yiran He, Yi Jiang:
Existence and boundedness of solutions to maximal monotone inclusion problem. 1565-1570 - Enrica Zola
Optimising for energy or robustness? Trade-offs for VM consolidation in virtualized datacenters under uncertainty. 1571-1592 - Xing Wang, Ya-wei Qi
A class of differential fuzzy variational inequalities in finite-dimensional spaces. 1593-1607 - Jae-Hyoung Lee, Liguo Jiao
On quasi ϵ-solution for robust convex optimization problems. 1609-1622 - Ernesto G. Birgin
On the minimization of possibly discontinuous functions by means of pointwise approximations. 1623-1637 - Jiulin Wang, Yong Xia:
A linear-time algorithm for the trust region subproblem based on hidden convexity. 1639-1646 - Suliman Al-Homidan, Qamrul Hasan Ansari, Nguyen Van Luong
Finite convergence analysis and weak sharp solutions for variational inequalities. 1647-1662 - Junran Lichen, Jianping Li, Ko-Wei Lih:
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. 1663-1675 - Michel H. Geoffroy
Convergence of relaxed minimizers in set optimization. 1677-1690 - Maziar Salahi
Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem. 1691-1697 - Satoshi Suzuki, Daishi Kuroiwa:
Characterizations of the solution set for non-essentially quasiconvex programming. 1699-1712 - Liyun Huang, Zhou Wei:
On metric subregularity for convex constraint systems by primal equivalent conditions. 1713-1728 - Kensuke Aihara, Hiroyuki Sato
A matrix-free implementation of Riemannian Newton's method on the Stiefel manifold. 1729-1741 - Dmitry B. Rokhlin
Minimax perfect stopping rules for selling an asset near its ultimate maximum. 1743-1756 - Fabiano de S. Oliveira
A note on counting independent terms in asymptotic expressions of computational complexity. 1757-1765 - Chen Ling, Hongjin He, Liqun Qi
Improved approximation results on standard quartic polynomial optimization. 1767-1782 - Fredrik Andersson
Convex envelopes for fixed rank approximation. 1783-1795 - André Berger, Alexander Grigoriev
Location, pricing and the problem of Apollonius. 1797-1805
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: