default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Letters, Volume 9
Volume 9, Number 1, January 2015
- Vaithilingam Jeyakumar
, Guoyin Li, José Vicente-Pérez:
Robust SOS-convex polynomial optimization problems: exact SDP relaxations. 1-18 - Warren P. Adams, Hanif D. Sherali:
RLT insights into lift-and-project closures. 19-39 - Phillippe Samer, Sebastián Urrutia:
A branch and cut algorithm for minimum spanning trees under conflict constraints. 41-55 - Giampaolo Liuzzi, Francesco Rinaldi:
Solving ℓ0-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method. 57-74 - Guo-ji Tang, Xing Wang, Zhong-bao Wang:
Existence of variational quasi-hemivariational inequalities involving a set-valued operatorand a nonlinear term. 75-90 - Jun Pei, Xinbao Liu, Panos M. Pardalos, Wenjuan Fan, Shanlin Yang:
Single machine serial-batching scheduling with independent setup time and deteriorating job processing times. 91-104 - V. Pragadeeswarar, M. Marudai:
Best proximity points for generalized proximal weak contractions in partially ordered metric spaces. 105-118 - Elham Mardaneh, Louis Caccetta:
Impact of price-adjustments costs on integration of pricing and production planning of multiple-products. 119-142 - Ayse Akbalik, Bernard Penz, Christophe Rapine:
Multi-item uncapacitated lot sizing problem with inventory bounds. 143-154 - Xiao-bo Li, Nan-Jing Huang:
Generalized vector quasi-equilibrium problems on Hadamard manifolds. 155-170 - Xiao-bo Li, Nan-Jing Huang:
Erratum to: Generalized vector quasi-equilibrium problems on Hadamard manifolds. 171 - Mariano Luque:
Modified interactive chebyshev algorithm (MICA) for non-convex multiobjective programming. 173-187 - Carlos Segura, Carlos A. Coello Coello, Eduardo Segredo, Coromoto León:
On the adaptation of the mutation scale factor in differential evolution. 189-198 - Atsushi Miyauchi, Noriyoshi Sukegawa:
Redundant constraints in the standard formulation for the clique partitioning problem. 199-207
Volume 9, Number 2, February 2015
- Samir Elhedhli, Fatma Gzara:
Characterizing the optimality gap and the optimal packings for the bin packing problem. 209-223 - Jia Tang, Changfeng Ma:
A smoothing Newton method for symmetric cone complementarity problems. 225-244 - Elena Constantin:
Second-order necessary conditions in locally Lipschitz optimization with inequality constraints. 245-261 - Giuseppe Marino, Luigi Muglia:
On the auxiliary mappings generated by a family of mappings and solutions of variational inequalities problems. 263-282 - D. Ataee Tarzanagh, Z. Saeidian, M. Reza Peyghami, Hamid Mesgrani:
A new trust region method for solving least-square transformation of system of equalities and inequalities. 283-310 - Antonio J. Vázquez, Richard Scott Erwin:
On the tractability of satellite range scheduling. 311-327 - Prashanto Chatterjee, C. S. Lalitha:
Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency. 329-343 - Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux:
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. 345-357 - Vahid Momenaei Kermani, A. R. Doagooei:
Vector topical functions and Farkas type theorems with applications. 359-374 - Adil M. Bagirov, Julien Ugon, Hijran G. Mirzayeva:
An algorithm for clusterwise linear regression based on smoothing techniques. 375-390 - Ke Quan Zhao, Xin Min Yang:
Characterizations of efficiency in vector optimization with $$\mathcal {C}(T)$$ C ( T ) -valued mappings. 391-401 - Ming Liu, Feifeng Zheng, Jinfeng Li:
Scheduling small number of quay cranes with non-interference constraint. 403-412
Volume 9, Number 3, March 2015
- Marco Locatelli, Massimiliano Vasile:
(Non) convergence results for the differential evolution method. 413-425 - Adam Kasperski, Pawel Zielinski:
Complexity of the robust weighted independent set problems on interval graphs. 427-436 - Luigi Di Puglia Pugliese, Francesca Guerriero, José Luis Esteves dos Santos:
Dynamic programming for spanning tree problems: application to the multi-objective case. 437-450 - Marta S. R. Monteiro, Dalila B. M. M. Fontes, Fernando A. C. C. Fontes:
The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach. 451-464 - Imen Hamdi, Taïcir Loukil:
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. 465-482 - Boualem Alleche, Vicentiu D. Radulescu, Madjid Sebaoui:
The Tikhonov regularization for equilibrium problems and applications to quasi-hemivariational inequalities. 483-503 - Qinghong Zhang:
A note on the minimal cone for conic linear programming. 505-512 - María J. Cánovas, Abderrahim Hantoute, Juan Parra, F. Javier Toledo:
Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization. 513-521 - Cheng Lu, Xiaoling Guo:
Convex reformulation for binary quadratic programming problems via average objective value maximization. 523-535 - Weiya Zhong:
An improved algorithm for integrated production and distribution scheduling problem with committed delivery dates. 537-567 - Francisco J. Aragón Artacho, Ronan M. T. Fleming:
Globally convergent algorithms for finding zeros of duplomonotone mappings. 569-584 - Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Potential energy principles in networked systems and their connections to optimization problems on graphs. 585-600 - Celso C. Ribeiro, Isabel Rosseti:
tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. 601-614
Volume 9, Number 4, April 2015
- Chrysafis Vogiatzis, Alexander Veremyev, Eduardo L. Pasiliao, Panos M. Pardalos:
An integer programming approach for finding the most and the least central cliques. 615-633 - Cristiano Arbex Valle, Nigel Meade, John E. Beasley:
An optimisation approach to constructing an exchange-traded fund. 635-661 - Óscar C. Vásquez:
For the airplane refueling problem local precedence implies global precedence. 663-675 - Tiago Araújo Neves, Luiz Satoru Ochi, Célio Vinicius N. de Albuquerque:
A new hybrid heuristic for replica placement and request distribution in content distribution networks. 677-692 - Z. R. Gabidullina:
Necessary and sufficient conditions for emptiness of the cones of generalized support vectors. 693-729 - Orizon Pereira Ferreira, Sándor Zoltán Németh:
Projection onto simplicial cones by a semi-smooth Newton method. 731-741 - Maryam Tahmasbi, Narges Mirehi:
Thick non-crossing paths in a polygonal domain. 743-753 - Caiping Liu, Xinmin Yang:
Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications. 755-768 - Ovidiu Bagdasar, Nicolae Popovici:
Local maximum points of explicitly quasiconvex functions. 769-777 - Changjie Fang, Sheng-lan Chen:
A projection algorithm for set-valued variational inequalities on Hadamard manifolds. 779-794 - Wei Li:
A note on dependency between interval linear systems. 795-797 - Effrosyni Theodorou, Ali Diabat:
A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results. 799-817
Volume 9, Number 5, June 2015
- Zizhuo Wang:
On solving convex optimization problems with linear ascending constraints. 819-838 - Dmitriy S. Malyshev, Panos M. Pardalos:
The clique problem for graphs with a few eigenvalues of the same sign. 839-843 - Rommel G. Regis:
The calculus of simplex gradients. 845-865 - Radu Ioan Bot, Christopher Hendrich:
Convex risk minimization via proximal splitting methods. 867-885 - Victor Magron:
Error bounds for polynomial optimization over the hypercube using putinar type representations. 887-895 - Atsushi Miyauchi, Noriyoshi Sukegawa:
Maximizing Barber's bipartite modularity is also hard. 897-913 - Milagros Loreto, Alejandro Crema:
Convergence analysis for the modified spectral projected subgradient method. 915-929 - Sona Taheri, Musa A. Mammadov:
Structure learning of Bayesian Networks using global optimization with applications in data classification. 931-948 - Ciaran McCreesh, Patrick Prosser:
A parallel branch and bound algorithm for the maximum labelled clique problem. 949-960 - Hui Zhang, Lizhi Cheng:
Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization. 961-979 - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
Moderately exponential time algorithms for the maximum induced matching problem. 981-998 - Ioannis E. Livieris, Panagiotis E. Pintelas:
A modified Perry conjugate gradient method and its global convergence. 999-1015 - Juan Enrique Martínez-Legaz:
Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints. 1017-1023 - Mengyang Gu, Zhiyi Tan, Binzhou Xia, Yujie Yan:
A new approach for bicriteria partitioning problem. 1025-1037
Volume 9, Number 6, August 2015
- Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman:
On a convex set with nondifferentiable metric projection. 1039-1052 - Olav Bjerkholt, Sjur Didrik Flåm:
Ragnar Frisch and interior-point methods. 1053-1061 - Shu Wang, Yong Xia:
Strong duality for generalized trust region subproblem: S-lemma with interval bounds. 1063-1073 - Youpan Han, Zhiping Chen:
Quantitative stability of full random two-stage stochastic programs with recourse. 1075-1090 - Rajan Filomeno Coelho:
Bi-objective hypervolume-based Pareto optimization - A gradient-based approach as an alternative to evolutionary algorithms. 1091-1103 - G. Q. Wang, X. J. Fan, D. T. Zhu, D. Z. Wang:
New complexity analysis of a full-Newton step feasible interior-point algorithm for P∗(κ)-LCP. 1105-1119 - Nader Kanzi:
On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data. 1121-1129 - Valeriano Antunes de Oliveira, Lucelina Batista dos Santos, Rafaela Osuna Gómez, Marko Antonio Rojas-Medar:
Optimality conditions for nonlinear infinite programming problems. 1131-1147 - B. C. Giri, S. Sharma:
An integrated inventory model for a deteriorating item with allowable shortages and credit linked wholesale price. 1149-1175 - Joydeep Dutta:
Barrier method in nonsmooth convex optimization without convex representation. 1177-1185 - Mohammadali Shirazi, Hedayat Z. Aashtiani:
Solving the minimum toll revenue problem in real transportation networks. 1187-1197 - Kai Wang, Jitamitra Desai, Hongjin He:
A note on augmented Lagrangian-based parallel splitting method. 1199-1212 - Wei Lv, Qiang Sun, He Lin, Ruirui Sui:
A penalty derivative-free algorithm for nonlinear constrained optimization. 1213-1229 - Meijuan Shang, Chao Zhang, Dingtao Peng, Shenglong Zhou:
A half thresholding projection algorithm for sparse solutions of LCPs. 1231-1245 - Holger H. Hoos, Thomas Stützle:
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances. 1247-1254 - Isabel Correia, Francisco Saldanha-da-Gama:
A note on "branch-and-price approach for the multi-skill project scheduling problem". 1255-1258 - Boris G. Mirkin:
Book review "Cell formation in industrial engineering: theory, algorithms and experiments" by Boris Goldengorin, Dmitry Krushinsky, Panos M. Pardalos - Springer, 2013. 1259-1262
Volume 9, Number 7, October 2015
- Jean B. Lasserre:
Volume of slices and sections of the simplex in closed form. 1263-1269 - Björn Sachsenberg, Klaus Schittkowski:
A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems. 1271-1282 - Jianqiang Cheng, Michal Houda, Abdel Lisser:
Chance constrained 0-1 quadratic programs using copulas. 1283-1295 - Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev:
Threshold robustness in discrete facility location problems: a bi-objective approach. 1297-1314 - Yan Xia, Murat Kurt:
Control-limit policies for a class of stopping time problems with termination restrictions. 1315-1329 - Gary A. Kochenberger, Mark W. Lewis, Fred W. Glover, Haibo Wang:
Exact solutions to generalized vertex covering problems: a comparison of two models. 1331-1339 - Jinkui Liu, Shengjie Li:
Spectral gradient method for impulse noise removal. 1341-1351 - Sorin Radulescu, Diana-Olimpia Alexandrescu, Vicentiu D. Radulescu:
Facility location in normed linear spaces. 1353-1369 - Natasa Krejic, Zorana Luzanin, Filip Nikolovski, Irena Stojkovska:
A nonmonotone line search method for noisy minimization. 1371-1391 - José M. Alonso-Meijide, Mikel Álvarez-Mozos, M. Gloria Fiestras-Janeiro:
The least square nucleolus is a normalized Banzhaf value. 1393-1399 - Prasit Cholamjiak:
The modified proximal point algorithm in CAT(0) spaces. 1401-1410 - Kaiping Luo, Xinhui Zhang:
A simple proof technique for scheduling models with learning effects. 1411-1420 - Xiao-Liang Dong, Hongwei Liu, Yin Ling Xu, Xi Mei Yang:
Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence. 1421-1432 - Xinhe Miao, Jein-Shan Chen:
Characterizations of solution sets of cone-constrained convex programming problems. 1433-1445 - Massimiliano Caramia, Renato Mari:
Enhanced exact algorithms for discrete bilevel linear problems. 1447-1468 - Olvi L. Mangasarian:
A hybrid algorithm for solving the absolute value equation. 1469-1474
Volume 9, Number 8, December 2015
- Vladimir Boginski, Eduardo L. Pasiliao, Siqian Shen:
Special issue on optimization in military applications. 1475-1476 - Dennis P. Michalopoulos, J. Wesley Barnes, David P. Morton:
Prioritized interdiction of nuclear smuggling via tabu search. 1477-1494 - Fabio D'Andreagiovanni:
Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization. 1495-1510 - Benjamin C. Grannan, Nathaniel D. Bastian, Laura A. McLay:
A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets. 1511-1531 - Longfei Wang, Jie Song, Leyuan Shi:
Dynamic emergency logistics planning: models and heuristic algorithm. 1533-1552 - Zhouchun Huang, Qipeng P. Zheng:
Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs. 1553-1568 - Anke Stieber, Armin Fügenschuh, Maria Epp, Matthias Knapp, Hendrik Rothe:
The multiple traveling salesmen problem with moving targets. 1569-1583 - Jean Berger, Nassirou Lo, Abdeslem Boukhtouta, Martin Noël:
An information theoretic based integer linear programming approach for the discrete search path planning problem. 1585-1607 - Tanya E. Kannon, Sarah G. Nurre, Brian J. Lunday, Raymond R. Hill:
The aircraft routing problem with refueling. 1609-1624 - Nils-Hassan Quttineh, Torbjörn Larsson:
Military aircraft mission planning - Efficient model-based metaheuristic approaches. 1625-1639 - Daniel Stimpson, Rajesh Ganesan:
A reinforcement learning approach to convoy scheduling on a contested transportation network. 1641-1657 - Magnar Vestli, Lars Lundsbakken, Kjetil Fagerholt, Lars Magnus Hvattum:
Scheduling fighter squadron training missions using column generation. 1659-1674 - Ryan R. Squires, Karla L. Hoffman:
A military maintenance planning and scheduling problem. 1675-1688 - Darryl K. Ahner, Carl Parson:
Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming. 1689-1701 - Philipp Hungerländer:
A semidefinite optimization approach to the Target Visitation Problem. 1703-1727 - Necip Dirik, Shane N. Hall, James T. Moore:
Maximizing strike aircraft planning efficiency for a given class of ground targets. 1729-1748 - Dinçer Konur, Cihan H. Dagli:
Military system of systems architecting with individual system contracts. 1749-1767 - Andrew O. Hall, Michael C. Fu:
Optimal Army officer force profiles. 1769-1785 - Monali S. Malvankar-Mehta, Siddhartha S. Mehta:
Optimal task allocation in multi-human multi-robot interaction. 1787-1803
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 2025-11-26 07:57 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:
