default search action
Optimization Letters, Volume 8
Volume 8, Number 1, January 2014
- Shabbir Ahmed
:
Convex relaxations of chance constrained optimization problems. 1-12 - Peter Hinow:
A nonsmooth program for jamming hard spheres. 13-33 - Jiri Rohn, Vahideh Hooshyarbakhsh, Raena Farhadsefat:
An iterative method for solving absolute value equations and sufficient conditions for unique solvability. 35-44 - Alla R. Kammerdiner, Alex Sprintson
Optimization of discrete broadcast under uncertainty using conditional value-at-risk. 45-59 - H. Mezali, John E. Beasley
Index tracking with fixed and variable transaction costs. 61-80 - Mohsen Alimohammady
Notes on the difference of two monotone operators. 81-84 - Sebastian Sitarz
Parametric LP for sensitivity analysis of efficiency in MOLP problems. 85-98 - Muhammad Aslam Noor
Existence theorems for multivalued variational inequality problems on uniformly prox-regular sets. 99-111 - Yuan-Yuan Lu, Gang Li, Yu-Bin Wu, Ping Ji
Optimal due-date assignment problem with learning effect and resource-dependent processing times. 113-127 - Li-Yan Wang, Xue Huang, Ping Ji
Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time. 129-134 - Wen-Chiung Lee:
Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning. 135-144 - Ahmed Wasif Reza
A comprehensive study of optimization algorithm for wireless coverage in indoor area. 145-157 - Zai-Yun Peng, S. S. Chang:
On the lower semicontinuity of the set of efficient solutions to parametric generalized systems. 159-169 - Joseph L. Rios, Kevin Ross:
Converging upon basic feasible solutions through Dantzig-Wolfe decomposition. 171-180 - Mojtaba Hoseini, Hossein Hosseinpour, Bijan Bastaee
A new multi objective optimization approach in distribution systems. 181-199 - Cong Tian, Zhenhua Duan, Jin Liu:
Secure communications with strange planet protocol. 201-209 - S. Homaeipour, Abdolrahman Razani
Convergence of an iterative method for relatively nonexpansive multi-valued mappings and equilibrium problems in Banach spaces. 211-225 - Fabrice Talla Nobibon, Roel Leus
Robust maximum weighted independent-set problems on interval graphs. 227-235 - Jonathan M. Borwein
Some results on the convexity of the closure of the domain of a maximally monotone operator. 237-246 - Atle Seierstad:
Existence of open loop Nash equilibria in certain types of nonlinear differential games. 247-258 - Na Huang, Changfeng Ma:
A sufficient condition that has no exceptional family of elements for SDCP. 259-265 - Yuan Hong, Jaideep Vaidya:
An inference-proof approach to privacy-preserving horizontally partitioned linear programs. 267-277 - Fu-quan Xia
A projection subgradient method for solving optimization with variational inequality constraints. 279-292 - T. C. E. Cheng
Scheduling with a position-weighted learning effect. 293-306 - L. L. Liu, C. T. Ng
Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan. 307-318 - Haiwen Xu
On the $$O(1/t)$$ convergence rate of the LQP prediction-correction method. 319-328 - Tran T. A. Nghia:
A note on implicit multifunction theorems. 329-341 - Shazia Ghufran, Saman Khowaja, M. J. Ahsan:
Compromise allocation in multivariate stratified sample surveys under two stage randomized response model. 343-357 - Wenxing Zhu, Yuanhui Yan:
Solving the weighted MAX-SAT problem using the dynamic convexized method. 359-374 - Milan Hladík
How to determine basis stability in interval linear programming. 375-389 - Juan Enrique Martínez-Legaz
On Weierstrass extreme value theorem. 391-393 - Marek Debczynski
Maximum cost scheduling of jobs with mixed variable processing times and $$k$$ -partite precedence constraints. 395-400
Volume 8, Number 2, February 2014
- Xavier Bonnefond, Pierre Maréchal:
Convex spectral functions and approximate intertwining relationships. 401-405 - Isaac F. Fernandes, Daniel Aloise
On the Weber facility location problem with limited distances and side constraints. 407-424 - Zaixin Lu, Lidong Wu, Panos M. Pardalos, Eugene Maslov, Wonjun Lee, Ding-Zhu Du:
Routing-efficient CDS construction in Disk-Containment Graphs. 425-434 - Christos A. Pappas, Angelos-Christos G. Anadiotis
Heuristics for the multi-level capacitated minimum spanning tree problem. 435-446 - Jiawei Chen, Zhongping Wan, Yun-Zhi Zou:
Bilevel invex equilibrium problems with applications. 447-461 - Mihaela Miholca:
On set-valued optimization problems and vector variational-like inequalities. 463-476 - Chao Wang, Jinghuai Gao:
A differential evolution algorithm with cooperative coevolutionary selection operation for high-dimensional optimization. 477-492 - Xue Huang, Ming-Zheng Wang, Ping Ji
Parallel machines scheduling with deteriorating and learning effects. 493-500 - Siwaporn Saewan, Yeol Je Cho, Poom Kumam
Weak and strong convergence theorems for mixed equilibrium problems in Banach spaces. 501-518 - Chou-Jung Hsu, Dar-Li Yang
Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time. 519-531 - Wei-Qi Deng:
Strong convergence of Mann's type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces. 533-542 - T. C. E. Cheng
Single-machine scheduling with accelerating deterioration effects. 543-554 - A. G. Arrondo, José Fernández
An approach for solving competitive location problems with variable demand using multicore systems. 555-567 - Hao-Chun Lu
A note on "Reducing the number of binary variables in cutting stock problems". 569-579 - A. Amini-Harandi:
Common best proximity points theorems in metric spaces. 581-589 - Dan Wang, Yunzhang Huo, Ping Ji
Single-machine group scheduling with deteriorating jobs and allotted resource. 591-605 - Jianke Zhang, Sanyang Liu, Lifeng Li, Quanxi Feng:
The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function. 607-631 - Shiang-Tai Liu:
Fuzzy efficiency ranking in fuzzy two-stage data envelopment analysis. 633-652 - El-Desouky Rahmo, Aleksandra Stasiak
Lower and upper Ginchev derivatives of vector functions and their applications to multiobjective optimization. 653-667 - Xue-Ru Wang, Ji-Bo Wang, Jian Jin, Ping Ji
Single machine scheduling with truncated job-dependent learning effect. 669-677 - Ravi Kothari, Diptesh Ghosh
An efficient genetic algorithm for single row facility layout. 679-690 - Amor A. Menezes
Optimal search efficiency of Barker's algorithm with an exponential fitness function. 691-703 - Alan R. R. de Freitas, Frederico Gadelha Guimarães
Memetic self-adaptive evolution strategies applied to the maximum diversity problem. 705-714 - Ziauddin Ursani:
Computing availability for redundant flow systems. 715-725 - Pham N. Anh, Le Dung Muu:
A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems. 727-738 - Mohammad M. Alshahrani
Nonsmooth variational-like inequalities and nonsmooth vector optimization. 739-751 - A. R. R. Freitas, V. M. R. Silva, Felipe Campelo
Optimizing two-level reverse distribution networks with hybrid memetic algorithms. 753-762 - Wanyou Cheng, Qunfeng Liu
An accurate active set conjugate gradient algorithm with project search for bound constrained optimization. 763-776 - Dariusz R. Kowalski, Eyal Nussbaum, Michael Segal
Scheduling problems in transportation networks of line topology. 777-799
Volume 8, Number 3, March 2014
- David R. Morrison, Jason J. Sauppe, Sheldon H. Jacobson
An algorithm to solve the proportional network flow problem. 801-809 - Lijie Bai, John E. Mitchell, Jong-Shi Pang:
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints. 811-822 - Mujahid N. Syed
On the optimization properties of the correntropic loss function in data analysis. 823-839 - G. G. Bolotashvili, Vitali M. Demidenko, Nicolai N. Pisaruk
Fence facets from non-regular graphs for the linear ordering polytope. 841-848 - Warren L. Hare, Chayne Planiden:
The NC-proximal average for multiple functions. 849-860 - Martin Branda
Sample approximation technique for mixed-integer stochastic programming problems with expected value constraints. 861-875 - Xue-ping Luo:
Tikhonov regularization methods for inverse variational inequalities. 877-887 - Yadamsuren Lutbat, Rentsen Enkhbat, Suk Hwan Lee
Parametric network utility maximization problem. 889-901 - Alberto Costa
A locally optimal hierarchical divisive heuristic for bipartite modularity maximization. 903-917 - Mette Gamst
A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem. 919-937 - Mirai Tanaka, Kazuhide Nakata:
Positive definite matrix approximation with condition number constraint. 939-947 - Yuriy Stoyan
Packing unequal circles into a strip of minimal length with a jump algorithm. 949-970 - Ji-Bo Wang, Jian-Jun Wang
Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects. 971-982 - H. Kaan Okyay, Fikri Karaesmen
Newsvendor models with dependent random supply and demand. 983-999 - Fazlollah Soleymani
A multi-step class of iterative methods for nonlinear systems. 1001-1015 - Behrouz Kheirfam, N. Mahdavi-Amiri
A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem. 1017-1029 - Qiao-Li Dong, Yonghong Yao
Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces. 1031-1046 - Zhi-Ang Zhou
ε-Optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces. 1047-1061 - Xi Li, Xue-song Li, Nan-Jing Huang:
A generalized $f$ -projection algorithm for inverse mixed variational inequalities. 1063-1076 - Yuhua Sun, Xiumei Xu, Laisheng Wang:
Duality and saddle-point type optimality for interval-valued programming. 1077-1091 - Weidong Li
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. 1093-1099 - Moosa Gabeleh
Best proximity points: global minimization of multivalued non-self mappings. 1101-1112 - Kaleem Raza Kazmi, S. H. Rizvi
An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping. 1113-1124 - Emilio Carrizosa
Heuristic approaches for support vector machines with the ramp loss. 1125-1135 - Christopher John Price
One side cut accelerated random search. 1137-1148 - Yangdong Xu, Shengjie Li:
Nonlinear separation functions and constrained extremum problems. 1149-1160 - Benjian Lv, Kaishun Wang, Jun Guo:
Error-tolerance pooling designs based on Johnson graphs. 1161-1165 - Claudia O. López
A note on solving MINLP's using formulation space search. 1167-1182 - Maciej Drwal:
Algorithm for quadratic semi-assignment problem with partition size coefficients. 1183-1190 - Jean-Paul Penot:
Directionally limiting subdifferentials and second-order optimality conditions. 1191-1200
Volume 8, Number 4, April 2014
- Jiaming Qiu, Thomas C. Sharkey
A dynamic edge covering and scheduling problem: complexity results and approximation algorithms. 1201-1212 - Laura Galli, Adam N. Letchford
A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs. 1213-1224 - Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. 1225-1243 - Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao
Exact identification of critical nodes in sparse networks via new compact formulations. 1245-1259 - Xue-ping Luo, Jun Yang:
Regularization and iterative methods for monotone inverse variational inequalities. 1261-1272 - Haifeng Ma, Cheng Shao
Single machine scheduling with exponential learning functions. 1273-1285 - Wei Li, Jiajia Luo, Qin Wang, Ya Li:
Checking weak optimality of the solution to linear programming with interval right-hand side. 1287-1299 - Mian-Tao Chao, Cao-zong Cheng:
Linear and nonlinear error bounds for lower semicontinuous functions. 1301-1312 - Guo-ji Tang, Fu-quan Xia
Strong convergence of a splitting projection method for the sum of maximal monotone operators. 1313-1324 - Pham Duy Khanh:
On the Tikhonov regularization of affine pseudomonotone mappings. 1325-1336 - Doreen A. Thomas
Euclidean Steiner trees optimal with respect to swapping 4-point subtrees. 1337-1359 - Surjeet Kaur Suneja, Sunila Sharma, Malti Kapoor:
Modified objective function method in nonsmooth vector optimization over cones. 1361-1373 - Teodor Gabriel Crainic
Service network design models for two-tier city logistics. 1375-1387 - Ping Ji
Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity. 1389-1400 - Apostolos Kotsialos
Nonlinear optimisation using directional step lengths based on RPROP. 1401-1415 - Ernesto G. Birgin
A MILP model for an extended version of the Flexible Job Shop Problem. 1417-1431 - Yong Hsia:
Complexity and nonlinear semidefinite programming reformulation of ℓ1-constrained nonconvex quadratic optimization. 1433-1442 - Evgeny R. Gafarov, Alexandre Dolgui
Two-dedicated-machine scheduling problem with precedence relations to minimize makespan. 1443-1451 - Dionne M. Aleman
A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning. 1453-1473 - Xue Huang, Ming-Zheng Wang:
Single machine group scheduling with time and position dependent processing times. 1475-1485 - Min Li, Zhikai Jiang:
The PPA-based numerical algorithm with the O(1/t) convergence rate for variant variational inequalities. 1487-1500 - Agostinho Agra
Facets for the single node fixed-charge network set with a node set-up variable. 1501-1515 - Nader Kanzi
Optimality conditions for nonsmooth semi-infinite multiobjective programming. 1517-1528 - Olvi L. Mangasarian:
Linear complementarity as absolute value equation solution. 1529-1534 - Qun Lin
Optimal feedback control for dynamic systems with state constraints: An exact penalty approach. 1535-1551 - Gianpiero Bianchi, Renato Bruni, Alessandra Reale:
Balancing of agricultural census data by using discrete optimization. 1553-1565 - Sébastien Besset, Louis Jezequel:
Modal criteria for robust optimization of vibroacoustic systems. 1567-1576 - Eduardo Conde
A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines. 1577-1589 - Jiri Rohn:
A Farkas-type theorem for interval linear inequalities. 1591-1598
Volume 8, Number 5, June 2014
- Luc Adjengue, Charles Audet, Imen Ben Yahia:
A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm. 1599-1610 - Austin Buchanan, Jose L. Walteros
Solving maximum clique in sparse graphs: an O(nm+n2d/4 algorithm for d-degenerate graphs. 1611-1617 - Michael Poss
A comparison of routing sets for robust network design. 1619-1635 - Lei-Hong Zhang, Wei Hong Yang, Li-Zhi Liao
A note on the trace quotient problem. 1637-1645 - Zhiping Chen, Feng Zhang:
Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse. 1647-1662 - Xiang-Kai Sun, Yi Chai
Gap functions and error bounds for generalized vector variational inequalities. 1663-1673 - Vivek Laha
On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials. 1675-1690 - Wenjie Li, Jinjiang Yuan:
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. 1691-1706 - Xiao-Le Guo, C. J. Zhao, Z. W. Li:
On generalized ϵ-subdifferential and radial epiderivative of set-valued mappings. 1707-1720 - Carlos Montoya, Odile Bellenguez-Morineau
Branch-and-price approach for the multi-skill project scheduling problem. 1721-1734 - Marc Lassonde:
Characterization of the monotone polar of subdifferentials. 1735-1740 - Ren-you Zhong, Xiang Liu, Jiang-hua Fan:
The existence of zeros of set-valued mappings in reflexive Banach spaces. 1741-1751 - Jingyong Tang, Li Dong, Liang Fang, Jinchuan Zhou:
Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search. 1753-1771 - Petter Brändén:
Hyperbolicity cones of elementary symmetric polynomials are spectrahedral. 1773-1782 - Lukasz Bieniasz-Krzywiec, Maciej Cytowski, Leszek Rychlewski, Dariusz Plewczynski
3D-Hit: fast structural comparison of proteins on multicore architectures. 1783-1794 - Jean B. Lasserre
Erratum to: On convex optimization without convex representation. 1795-1796
Volume 8, Number 6, August 2014
- Honglei Xu, Kok Lay Teo, Xinmin Yang, Mingyong Lai:
Special issue on the 5th international conference on optimization and control with applications (OCA5). 1797-1798 - Song Wang
A penalty method for a finite-dimensional obstacle problem with derivative constraints. 1799-1811 - Zhi-Ang Zhou, Xin-Min Yang, Jian-Wen Peng:
ϵ-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces. 1813-1827 - Bin Li, Hai Huyen Dam, Antonio Cantoni, Kok Lay Teo:
A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints. 1829-1843 - Zhong Wan
A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations. 1845-1860 - Xian-Jun Long, Nan-Jing Huang:
Optimality conditions for minimizing the difference of nonconvex vector-valued mappings. 1861-1872 - Xing Wang, Wei Li, Xue-song Li, Nan-Jing Huang:
Stability for differential mixed variational inequalities. 1873-1887 - Lei Liu, Ying Yang, Wanquan Liu
Unified optimization of H∞ index and upper stability bound for singularly perturbed systems. 1889-1904 - Qingling Zhang, Shuangyun Xing:
Stability analysis and optimal control of stochastic singular systems. 1905-1920 - Yongle Zhang, Yiran He, Yi Jiang:
Subdifferentials of a perturbed minimal time function in normed spaces. 1921-1930 - Yanyan Feng, Qiusheng Qiu:
Optimality conditions for vector equilibrium problems with constraint in Banach spaces. 1931-1944
Volume 8, Number 7, October 2014
- Antanas Zilinskas:
A one-step worst-case optimal algorithm for bi-objective univariate optimization. 1945-1960 - Cristiano Arbex Valle, Nigel Meade
Market neutral portfolios. 1961-1984 - Milan Hladík
On approximation of the best case optimal value in interval linear programming. 1985-1997 - Konstantin Pavlikov
CVaR norm and applications in optimization. 1999-2020 - Marius Durea
Scalarization of constraints system in some vector optimization problems and applications. 2021-2037 - Marius Durea
Erratum to: Scalarization of constraints system in some vector optimization problems and applications. 2039-2040 - S. Serovajsky:
State-constrained optimal control of nonlinear elliptic variational inequalities. 2041-2051 - Yongqiang Chen, Naihua Xiu, Dingtao Peng:
Global solutions of non-Lipschitz $$S_{2}$$ S 2 - $$S_{p}$$ S p minimization over the positive semidefinite cone. 2053-2064 - Bibhas Chandra Giri
Trade credit competition between two retailers in a supply chain under credit-linked retail price and market demand. 2065-2085 - Yuan Min Li, Deyun Wei:
Similarity automorphism invariance of some P-properties of linear transformations on Euclidean Jordan algebras. 2087-2098 - Abdellatif Moudafi, Balwant Singh Thakur
Solving proximal split feasibility problems without prior knowledge of operator norms. 2099-2110 - Douglas Soares Gonçalves
Discretization orders and efficient computation of cartesian coordinates for distance geometry. 2111-2125 - Ali P. Farajzadeh
When a vector quasimonotone mapping is a vector monotone mapping. 2127-2134 - Bogdan Grechuk:
A simple SSD-efficiency test. 2135-2143 - Javier Peña, Vera Roshchina
Some preconditioners for systems of linear inequalities. 2145-2152
Volume 8, Number 8, December 2014
- Pavlo A. Krokhmal, Oleg A. Prokopyev:
Optimization Letters Best Paper Award. 2153-2154 - Manuel A. Bolívar, Leonardo Lozano
Acceleration strategies for the weight constrained shortest path problem with replenishment. 2155-2172 - Alexander J. Zaslavski:
Agreeable solutions of discrete time optimal control problems. 2173-2184 - Valentin Zelenyuk:
Directional vs. Shephard's distance functions. 2185-2189 - Davod Khojasteh Salkuyeh:
The Picard-HSS iteration method for absolute value equations. 2191-2202 - Ilya Bychkov, Mikhail Batsyn
Exact model for the cell formation problem. 2203-2210 - Thi Thu Van Nguyen, Thi Phuong Dong Nguyen, Jean-Jacques Strodiot, Van Hien Nguyen:
A class of hybrid methods for quasi-variational inequalities. 2211-2226 - Ming-ge Yang, Yifan Xu:
Openness results for parametric set-valued mappings in Asplund spaces. 2227-2243 - Monica Gentili, Pitu B. Mirchandani:
Computational complexity analysis of the sensor location flow observability problem. 2245-2259 - Dmitriy S. Malyshev
The coloring problem for classes with two small obstructions. 2261-2270 - Maryam A. Alghamdi, Abdullah M. Alotaibi
A primal-dual method of partial inverses for composite inclusions. 2271-2284 - Saman Babaie-Kafaki, Reza Ghanbari
Two modified three-term conjugate gradient methods with sufficient descent property. 2285-2297 - Xiang-Kai Sun, Yi Chai
Farkas-type results for constrained fractional programming with DC functions. 2299-2313 - Yangdong Xu, Shengjie Li:
Continuity of the solution set mappings to a parametric set optimization problem. 2315-2327 - Hatem Hadda
Exact resolution of the two-stage hybrid flow shop with dedicated machines. 2329-2339 - Huilan Chang, Hung-Lin Fu, Chih-Huai Shih:
Learning a hidden graph. 2341-2348 - Xingyin Wang, Bruce L. Golden, Damon Gulczynski:
A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. 2349-2356 - Liren Huang, Jean-Paul Penot:
A note on the connection between Chaney's derivatives and epi-derivatives. 2357-2360
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: