Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Letters, Volume 6
Volume 6, Number 1, January 2012
- Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci
, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. 1-9 - Xinmin Yang, Kok Lay Teo:
A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming. 11-15 - Meetu Bhatia:
Higher order duality in vector optimization over cones. 17-30 - Xiaozheng He, Anthony Chen, Wanpracha Art Chaovalitwongse, Henry X. Liu:
An improved linearization technique for a class of quadratic 0-1 programming problems. 31-41 - Vsevolod I. Ivanov:
On the optimality of some classes of invex problems. 43-54 - Xu-Na Miao, Xian-Wei Zhou, Hua-Yi Wu:
A cooperative differential game model based on network throughput and energy efficiency in wireless networks. 55-68 - Jungyun Bae, Sivakumar Rathinam:
Approximation algorithms for multiple terminal, Hamiltonian path problems. 69-85 - Ji-Bo Wang, Ming-Zheng Wang:
Single-machine scheduling with nonlinear deterioration. 87-98 - Julia Piantadosi, Phil G. Howlett, Jonathan M. Borwein:
Copulas with maximum entropy. 99-125 - Hanif D. Sherali, J. Cole Smith:
Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs. 127-139 - Sai Yadlapalli, Sivakumar Rathinam, Swaroop Darbha:
3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem. 141-152 - Shujun Bi, Shaohua Pan, Jein-Shan Chen:
The same growth of FB and NR symmetric cone complementarity functions. 153-162 - Paola Festa:
Complexity analysis and optimization of the shortest path tour problem. 163-175 - Abdelkrim El Mouatasim, Rachid Ellaia, A. Al-Hossain:
A continuous approach to combinatorial optimization: application of water system pump operations. 177-198 - Radu Ioan Bot, Sorin-Mihai Grad, Gert Wanka:
Classical linear vector optimization duality revisited. 199-210 - Ilias S. Kotsireas, Christos Koukouvinos, Jennifer Seberry:
New weighing matrices constructed from two circulant submatrices. 211-217
Volume 6, Number 2, February 2012
- Pham Dinh Tao, Shashi Kant Mishra, Nguyen Dong Yen:
Preface. 219-220 - Lianbo Gao, Shashi Kant Mishra, Jianming Shi:
An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem. 221-230 - Jeong Min Hong, Moon Hee Kim, Gue Myung Lee:
On linear vector program and vector matrix game equivalence. 231-240 - Qamrul Hasan Ansari, Mahboubeh Rezaei:
Generalized pseudolinearity. 241-251 - Chandal Nahak, Ram N. Mohapatra:
Nonsmooth ρ - (η, θ)-invexity in multiobjective programming problems. 253-260 - Shashi Kant Mishra, Monika Jaiswal, Le Thi Hoai An:
Duality for nonsmooth semi-infinite programming problems. 261-271 - Pankaj Gupta, Mukesh Kumar Mehlawat, Shilpi Verma:
COTS selection using fuzzy interactive approach. 273-289 - E. González-Gutiérrez, Maxim I. Todorov:
A relaxation method for solving systems with infinitely many linear inequalities. 291-298 - Antara Kundu, Tripti Chakrabarti:
A multi-product continuous review inventory system in stochastic environment with budget constraint. 299-313 - Le Thi Hoai An, Duc Manh Nguyen, Pham Dinh Tao:
Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches. 315-329 - D. K. Bhattacharya:
Maximization of revenue in fishery model with Cobb-Douglas type of production function. 331-338 - S. K. Neogy, A. K. Das, Abhijit Gupta:
Generalized principal pivot transforms, complementarity theory and their applications in stochastic games. 339-356 - Pierre Maréchal:
A convexity theorem for multiplicative functions. 357-362 - Do Sang Kim, Nguyen Nang Tam, Nguyen Dong Yen:
Solution existence and stability of quadratically constrained convex quadratic programs. 363-373 - Sy-Ming Guu, Jying-Nan Wang, Sheng-Ching Wu:
Zero-level pricing method with transaction cost. 375-392
Volume 6, Number 3, March 2012
- Constantin Zalinescu:
On duality gap in linear conic problems. 393-402 - Michael J. Hirsch, Brandon C. Ha:
On the incorporation of adversarial reasoning in course of action analysis and resource allocation. 403-414 - Weidong Li, Yaomin Shi:
On the maximum TSP with γ-parameterized triangle inequality. 415-420 - Sigifredo Laengle, Gino Loyola:
Bargaining and negative externalities. 421-430 - Olvi L. Mangasarian:
Privacy-preserving horizontally partitioned linear programs. 431-436 - Giampaolo Liuzzi, A. Risi:
A decomposition algorithm for unconstrained optimization problems with partial derivative information. 437-450 - Abdellatif Moudafi, Muhammad Aslam Noor:
Penalty methods for a system of constrained variational inequalities. 451-458 - Ariana Pitea, Mihai Postolache:
Minimization of vectors of curvilinear functionals on the second order jet bundle - Necessary conditions. 459-470 - Yuan Min Li, Xing Tao Wang, De Yun Wei:
Improved smoothing Newton methods for symmetric cone complementarity problems. 471-487 - M. I. Loizides, Athanasios N. Yannacopoulos:
Lumpable Markov chains in risk management. 489-501 - Shengjie Li, Jia Zhai:
Second-order asymptotic differential properties and optimality conditions for weak vector variational inequalities. 503-523 - S. Gerasimidis, A. Ampatzis, C. D. Bisbos:
A mathematical programming computational model for disproportionate collapse analysis of steel building frames. 525-535 - Víctor Blanco, Justo Puerto:
A new complexity result on multiobjective linear integer programming using short rational generating functions. 537-543 - Céline Gicquel, Laurence A. Wolsey, Michel Minoux:
On discrete lot-sizing and scheduling on identical parallel machines. 545-557 - Hatem Hadda:
A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints. 559-569 - Zhe Liang, Wanpracha Art Chaovalitwongse:
A multicast problem with shared risk cost. 571-584 - Jiri Rohn:
A theorem of the alternatives for the equation |Ax| - |B||x| = b. 585-591 - Florian Jarre:
Burer's key assumption for semidefinite and doubly nonnegative relaxations. 593-599 - Jiri Rohn:
A note on generating P-matrices. 601-603
Volume 6, Number 4, April 2012
- Mauricio G. C. Resende, Rodrigo F. Toso, José Fernando Gonçalves, Ricardo M. A. Silva:
A biased random-key genetic algorithm for the Steiner triple covering problem. 605-619 - Yonghong Yao, Naseer Shahzad:
Strong convergence of a proximal point algorithm with general errors. 621-628 - Anja De Waegenaere, Jacco L. Wielhouwer:
A breakpoint search approach for convex resource allocation problems with bounded variables. 629-640 - Luciana Brugiolo Gonçalves, Simone de Lima Martins, Luiz Satoru Ochi, Anand Subramanian:
Exact and heuristic approaches for the set cover with pairs problem. 641-653 - Junliang Wu, Yong Wang:
Three kinds of convexity and concavity properties of optimal value function in parametric nonlinear programming. 655-663 - Panos M. Pardalos, Ingrida Steponavice, Antanas Zilinskas:
Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming. 665-678 - Masao Fukushima:
SOR- and Jacobi-type iterative methods for solving ℓ 1 - ℓ 2 problems by way of Fenchel duality. 679-686 - Murat Mut, Tamás Terlaky:
On the volumetric path. 687-693 - Shu Luan, Hang Gao, Peng Xu:
Boundary control of non-well-posed elliptic equations with nonlinear Neumann boundary conditions. 695-708 - Jiri Rohn:
A general method for enclosing solutions of interval linear equations. 709-717 - Min-Yuan Cheng, Kuo-Yu Huang, Hung-Ming Chen:
Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems. 719-729 - Qi-Lin Wang, Shengjie Li:
Sensitivity and stability for the second-order contingent derivative of the proper perturbation map in vector optimization. 731-748 - Nguyen Thi Quynh Trang:
Lipschitzian stability of parametric variational inequalities over perturbed polyhedral convex sets. 749-762 - Mounir El Maghri:
Pareto-Fenchel ε-subdifferential sum rule and ε-efficiency. 763-781 - Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko:
Discretization orders for distance geometry problems. 783-796 - Qiuhua Tang, Jie Li, Christodoulos A. Floudas, Mingxing Deng, Yunbing Yan, Zhongmin Xi, Pinghe Chen, Jianyi Kong:
Optimization framework for process scheduling of operation-dependent automobile assembly lines. 797-824 - Xiao-Yuan Wang, Dan Wang, Na Yin:
A note on single-machine scheduling with nonlinear deterioration. 825-826
Volume 6, Number 5, June 2012
- Roman V. Belavkin:
On evolution of an information dynamic system and its generating operator. 827-840 - Jean-Baptiste Hiriart-Urruty, Hai Yen Le:
Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function. 841-849 - Jiri Rohn:
An algorithm for computing all solutions of an absolute value equation. 851-856 - Immanuel M. Bomze, Marco Locatelli:
Separable standard quadratic optimization problems. 857-866 - Roy Cerqueti, Anna Grazia Quaranta:
The perspective of a bank in granting credits: an optimization model. 867-882 - Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Parameterized computational complexity of finding small-diameter subgraphs. 883-891 - Milan Hladík:
Complexity of necessary efficiency in interval linear programming and multiobjective linear programming. 893-899 - Elisa Pagani:
On Lagrangian duality in vector optimization: applications to the linear case. 901-914 - Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev:
Modelling transfer line design problem via a set partitioning problem. 915-926 - Roger Behling, Andreas Fischer:
A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods. 927-940 - Hideaki Iiduka, Yasushi Narushima:
Conjugate gradient methods using value of objective function for unconstrained optimization. 941-955 - Atid Kangtunyakarn:
Convergence theorem of common fixed points for a family of nonspreading mappings in Hilbert space. 957-961 - Nicolas Zufferey:
Optimization by ant algorithms: possible roles for an individual ant. 963-973 - Yi-gui Ou, Guan-shu Wang:
A new supermemory gradient method for unconstrained optimization problems. 975-992 - Rahul Varshney, Najmussehar, M. J. Ahsan:
An optimum multivariate stratified double sampling design in presence of non-response. 993-1008 - Aram V. Arutyunov:
On two questions of optimization theory concerning quadratic mappings. 1009-1015 - Jiri Rohn:
On Rump's characterization of P-matrices. 1017-1020 - Radoslaw Rudek:
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times. 1021-1025 - Muhammad Aslam Noor, Javed Iqbal, Khalida Inayat Noor, Eisa A. Al-Said:
On an iterative method for solving absolute value equations. 1027-1033
Volume 6, Number 6, August 2012
- O. Erhun Kundakcioglu, Gündüz Ulusoy, Tonguç Ünlüyurt:
Preface. 1035-1037 - Pinar Tapkan, Lale Özbakir, Adil Baykasoglu:
Bees Algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem. 1039-1049 - Semra Agrali:
A dynamic uncapacitated lot-sizing problem with co-production. 1051-1061 - Deniz Aksen, Onur Kaya, F. Sibel Salman, Yeliz Akça:
Selective and periodic inventory routing problem for waste vegetable oil collection. 1063-1080 - Umman Mahir Yildirim, Bülent Çatay:
A time-based pheromone approach for the ant system. 1081-1099 - Serhat Keçici, Necati Aras, Vedat Verter:
Incorporating the threat of terrorist attacks in the design of public service facility networks. 1101-1121 - Alper Döyen, Necati Aras, Gülay Barbarosoglu:
A two-echelon stochastic facility location model for humanitarian relief logistics. 1123-1145 - Ayfer Basar, Bülent Çatay, Tonguç Ünlüyurt:
A taxonomy for emergency service station location problem. 1147-1160 - Z. Caner Taskin, Tínaz Ekim:
Integer programming formulations for the minimum weighted maximal matching problem. 1161-1171 - Ufuk Bahçeci, Orhan Feyzioglu:
A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks. 1173-1184 - Serhan Duran, Julie L. Swann, Ertan Yakici:
Dynamic switching times from season to single tickets in sports and entertainment. 1185-1206 - Gürkan Üstünkar, Süreyya Özögür-Akyüz, Gerhard-Wilhelm Weber, Christoph M. Friedrich, Yesim Aydin Son:
Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach. 1207-1218
Volume 6, Number 7, October 2012
- Rentsen Enkhbat, Ider Tseveendorj:
Special Issue: Control and Optimization. 1219-1220 - Baasansuren Jadamba, Akhtar A. Khan, Miguel Sama:
Generalized solutions of quasi variational inequalities. 1221-1231 - Fabián Flores Bazán, Felipe Lara:
Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization. 1233-1249 - Abderrahman Bouhamidi, Khalide Jbilou:
A Kronecker approximation with a convex constrained optimization method for blind image restoration. 1251-1264 - Satoshi Matsumoto, Masaru Kamada, Renchin-Ochir Mijiddorj:
Adaptive image interpolation by cardinal splines in piecewise constant tension. 1265-1280 - Yadamsuren Lutbat, Rentsen Enkhbat, Won-Joo Hwang:
Large margin shortest path routing. 1281-1290 - Ali Mohammadi, Mohammad-Reza Sadeghi, Damoon Razmjooei:
A heuristic application of Integer Goal Programming and Taguchi Method for planning cable cutting process in power plant projects. 1291-1302 - Amr Radwan, Olga Vasilieva, Rentsen Enkhbat, Andreas Griewank, J. Guddat:
Parametric approach to optimal control. 1303-1316 - Dominique Fortin, Ider Tseveendorj:
Attractive force search algorithm for piecewise convex maximization problems. 1317-1333 - Alexander I. Tyatyushkin:
A multimethod technique for solving optimal control problem. 1335-1347 - Anatoly S. Antipin:
Two-person game with nash equilibrium in optimal control problems. 1349-1378 - L. Altangerel, G. Battur:
Perturbation approach to generalized Nash equilibrium problems with shared constraints. 1379-1391 - Ji-Bo Wang, Ping Ji, T. C. E. Cheng, Dan Wang:
Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. 1393-1409 - Shaoping Rui, Chengxian Xu:
Inexact non-interior continuation method for monotone semidefinite complementarity problems. 1411-1424 - Giorgio Gnecco, Marcello Sanguineti:
New insights into Witsenhausen's counterexample. 1425-1446 - Xin Yu, Naseer Shahzad, Yonghong Yao:
Implicit and explicit algorithms for solving the split feasibility problem. 1447-1462 - Michel Minoux:
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. 1463-1475 - Muhammad Aslam Noor, Khalida Inayat Noor, Eisa A. Al-Said:
On nonconvex bifunction variational inequalities. 1477-1484 - Yekini Shehu:
Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems. 1485-1497 - Fotis Foukalas, George T. Karetsos, Lazaros F. Merakos:
Capacity optimization through sensing threshold adaptation for cognitive radio networks. 1499-1511 - Bin Chen, Nan-Jing Huang:
Vector variational-like inequalities and vector optimization problems in Asplund spaces. 1513-1525 - Olvi L. Mangasarian:
Primal-dual bilinear programming solution of the absolute value equation. 1527-1533 - Boris S. Mordukhovich, Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando:
Hybrid proximal methods for equilibrium problems. 1535-1550 - Fangqiu Han, Zhiyi Tan, Yang Yang:
On the optimality of list scheduling for online uniform machines scheduling. 1551-1571 - Hyeong Soo Chang:
A policy iteration heuristic for constrained discounted controlled Markov Chains. 1573-1577 - Qi-Lin Wang, Shengjie Li, Kok Lay Teo:
Erratum to: Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization. 1579-1581
Volume 6, Number 8, December 2012
- Anurag Verma, Sergiy Butenko:
A distributed approximation algorithm for the bottleneck connected dominating set problem. 1583-1595 - Olga Brezhneva, Alexey Tret'yakov, Stephen E. Wright:
A short elementary proof of the Lagrange multiplier theorem. 1597-1601 - GuoLin Yu, Yangyang Lu, Yan Jiang:
Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications. 1603-1611 - C. P. Liu, H. W. Joseph Lee, Xinmin Yang:
Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity. 1613-1626 - Baro Hyun, Pierre T. Kabamba, Anouck R. Girard:
Optimally-informative path planning for dynamic Bayesian classification. 1627-1642 - Yue Zheng, Zhongping Wan:
A new variant of the memory gradient method for unconstrained optimization. 1643-1655 - Ariana Pitea, Mihai Postolache:
Minimization of vectors of curvilinear functionals on the second order jet bundle: sufficient efficiency conditions. 1657-1669 - Antonio Mucherino, Carlile Lavor, Leo Liberti:
The discretizable distance geometry problem. 1671-1686 - Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Worst-case analysis of maximal dual feasible functions. 1687-1705 - Hyukseong Kwon, Daniel J. Pack:
Cooperative target localization by multiple unmanned aircraft systems using sensor fusion quality. 1707-1717 - Peng-Jen Lai, Chin-Chia Wu, Wen-Chiung Lee:
Single-machine scheduling with logarithm deterioration. 1719-1730 - Hatem Hadda, Najoua Dridi, Sonia Hajri-Gabouj:
A note on the two-stage hybrid flow shop problem with dedicated machines. 1731-1736 - Anila Gupta, Amit Kumar, Amarpreet Kaur:
Mehar's method to find exact fuzzy optimal solution of unbalanced fully fuzzy multi-objective transportation problems. 1737-1751 - Valeria Leggieri, Mohamed Haouari, Chefi Triki:
A branch-and-cut algorithm for the Steiner tree problem with delays. 1753-1771 - Jinchuan Zhou, Changyu Wang:
New characterizations of weak sharp minima. 1773-1785 - Xianyue Li, Shan Shan, Hongjie Du, Ailian Jiang, Weili Wu:
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas. 1787-1794 - Germana Landi, E. Loli Piccolomini:
A feasible direction method for image restoration. 1795-1817 - Ali Abkar, Moosa Gabeleh:
Generalized cyclic contractions in partially ordered metric spaces. 1819-1830 - Zi Xu, Yu-Hong Dai:
New stochastic approximation algorithms with adaptive step sizes. 1831-1846 - Issei Kuwano, Tamaki Tanaka:
Continuity of cone-convex functions. 1847-1853 - Suh-Jenq Yang, Chou-Jung Hsu, Dar-Li Yang:
Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance. 1855-1873 - Heinz H. Bauschke, Jonathan M. Borwein, Xianfu Wang, Liangjin Yao:
Every maximally monotone operator of Fitzpatrick-Phelps type is actually of dense type. 1875-1881 - Hayato Waki:
How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization. 1883-1896 - M. S. Beyranvand, M. Reza Peyghami, Mehdi Ghatee:
On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date. 1897-1911 - Chungen Shen, Xiongda Chen, Yumei Liang:
A regularized Newton method for degenerate unconstrained optimization problems. 1913-1933 - Tongquan Zhang, Ying Yin, Jianping Li:
Shortest path problems with left-side time windows. 1935-1943 - Hanif D. Sherali:
On a fractional minimal cost flow problem on networks. 1945-1949 - Baoqiang Fan, Yeping Sun, Rongjun Chen, Guochun Tang:
A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm. 1951-1955
a service of 
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-04-25 20:50 CEST 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:
