Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             184 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Absolute value equations with uncertain data Raayatpanah, M. A.

5 p. 1145-1156
artikel
2 A capacitated hub location problem in freight logistics multimodal networks Ambrosino, Daniela
2016
5 p. 875-901
artikel
3 A class of new modulus-based matrix splitting methods for linear complementarity problem Wu, Shiliang

5 p. 1427-1443
artikel
4 A comparison of routing sets for robust network design Poss, Michael
2013
5 p. 1619-1635
artikel
5 A DDF based model for efficiency evaluation in two-stage DEA Wanke, P. F.
2017
5 p. 1029-1044
artikel
6 A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints Caramia, Massimiliano
2015
5 p. 997-1019
artikel
7 A derivative-free optimization approach for the autotuning of a Forex trading strategy De Santis, Alberto

5 p. 1649-1664
artikel
8 A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems Achache, Mohamed
2018
5 p. 1039-1057
artikel
9 A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem Saif, Ahmed
2016
5 p. 1087-1100
artikel
10 Algorithms based on unions of nonexpansive maps Tam, Matthew K.
2018
5 p. 1019-1027
artikel
11 A limiting subdifferential version of Ekeland’s variational principle in set optimization Ansari, Qamrul Hasan

5 p. 1537-1551
artikel
12 Alternating forward–backward splitting for linearly constrained optimization problems Molinari, Cesare

5 p. 1071-1088
artikel
13 A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas Bianchi, Gianpiero
2015
5 p. 955-973
artikel
14 A modified Perry conjugate gradient method and its global convergence Livieris, Ioannis E.
2014
5 p. 999-1015
artikel
15 A modulus-based nonsmooth Newton’s method for solving horizontal linear complementarity problems Mezzadri, F.

5 p. 1785-1798
artikel
16 An algorithm for computing all solutions of an absolute value equation Rohn, Jiri
2011
5 p. 851-856
artikel
17 An approximation algorithm for the nth power metric facility location problem with linear penalties Wang, Yishui
2015
5 p. 983-993
artikel
18 An efficient parameterized logarithmic kernel function for linear optimization Bouafia, Mousaab
2017
5 p. 1079-1097
artikel
19 An elementary proof of the quadratic envelope characterization of zero-derivative points Jukić, Dragan
2017
5 p. 1155-1156
artikel
20 A new approach for bicriteria partitioning problem Gu, Mengyang
2014
5 p. 1025-1037
artikel
21 A new model for curriculum-based university course timetabling Colajanni, Gabriella

5 p. 1601-1616
artikel
22 A new supermemory gradient method for unconstrained optimization problems Ou, Yi-gui
2011
5 p. 975-992
artikel
23 An exact penalty approach to constrained minimization problems on metric spaces Zaslavski, Alexander J.
2012
5 p. 1009-1016
artikel
24 An exact result for $$(0, \pm \, 1)$$(0,±1)-vectors Frankl, Peter
2018
5 p. 1011-1017
artikel
25 An integer programming formulation of the key management problem in wireless sensor networks Xu, Guanglin

5 p. 1037-1051
artikel
26 An intractability result for the vertex 3-colourability problem Malyshev, D. S.

5 p. 1403-1409
artikel
27 A nonmonotone inexact Newton method for unconstrained optimization Gao, Huan
2015
5 p. 947-965
artikel
28 A non-triangular hub location problem Brimberg, Jack

5 p. 1107-1126
artikel
29 An optimization approach to parameter identification in variational inequalities of second kind Gwinner, Joachim
2017
5 p. 1141-1154
artikel
30 An optimum multivariate stratified double sampling design in presence of non-response Varshney, Rahul
2011
5 p. 993-1008
artikel
31 A note on lower Studniarski derivative of the perturbation map in parameterized vector optimization Wang, Q. L.
2012
5 p. 985-990
artikel
32 A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times Rudek, Radosław
2011
5 p. 1021-1025
artikel
33 A note on semicontinuity of the solution mapping for parametric set optimization problems Preechasilp, Pakkapon
2018
5 p. 1085-1094
artikel
34 A note on the trace quotient problem Zhang, Lei-Hong
2013
5 p. 1637-1645
artikel
35 A parallel branch and bound algorithm for the maximum labelled clique problem McCreesh, Ciaran
2014
5 p. 949-960
artikel
36 A pick-up and delivery problem for logistics e-marketplace services Beraldi, Patrizia

5 p. 1565-1577
artikel
37 Application of the penalty method to limit quasi-equilibrium problems Konnov, Igor

5 p. 1773-1783
artikel
38 Approximation and optimization of Darboux type differential inclusions with set-valued boundary conditions Mahmudov, Elimhan N.
2012
5 p. 871-891
artikel
39 A primal-dual interior-point algorithm with arc-search for semidefinite programming Zhang, Mingwang
2019
5 p. 1157-1175
artikel
40 A proximal Newton-type method for equilibrium problems Santos, P. J. S.
2017
5 p. 997-1009
artikel
41 A Python/C library for bound-constrained global optimization with continuous GRASP Silva, R. M. A.
2012
5 p. 967-984
artikel
42 ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems Boukouvala, Fani
2016
5 p. 895-913
artikel
43 A smoothing method for sparse optimization over convex sets Haddou, M.

5 p. 1053-1069
artikel
44 A strong convergence theorem for Tseng’s extragradient method for solving variational inequality problems Thong, Duong Viet

5 p. 1157-1175
artikel
45 A unified analysis of convex and non-convex ℓp-ball projection problems Won, Joong-Ho

5 p. 1133-1159
artikel
46 A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods Behling, Roger
2011
5 p. 927-940
artikel
47 A unified solving approach for two and three dimensional coverage problems in sensor networks Sterle, Claudio
2016
5 p. 1101-1123
artikel
48 A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm Adjengue, Luc
2013
5 p. 1599-1610
artikel
49 Balancing efficiency and equity in location-allocation models with an application to strategic EMS design Khodaparasti, S.
2015
5 p. 1053-1070
artikel
50 Best proximity points for proximal generalized contractions in metric spaces Amini-Harandi, A.
2012
5 p. 913-921
artikel
51 Best proximity point theorems on partially ordered sets Basha, S. Sadiq
2012
5 p. 1035-1043
artikel
52 Bin packing with divisible item sizes and rejection penalties Li, Jianping

5 p. 1587-1597
artikel
53 Boris S. Mordukhovich: Variational analysis and applications Henrion, René
2019
5 p. 1207-1209
artikel
54 Branch-and-price approach for the multi-skill project scheduling problem Montoya, Carlos
2013
5 p. 1721-1734
artikel
55 Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models Singh, Bismark

5 p. 1373-1391
artikel
56 Capacity management in public service facility networks: a model, computational tests and a case study Bruno, Giuseppe
2015
5 p. 975-995
artikel
57 Characterization of the monotone polar of subdifferentials Lassonde, Marc
2013
5 p. 1735-1740
artikel
58 Characterizing the solution set of convex optimization problems without convexity of constraints Sisarat, Nithirat

5 p. 1127-1144
artikel
59 Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization Garmanjani, R.

5 p. 1161-1179
artikel
60 Complexity of necessary efficiency in interval linear programming and multiobjective linear programming Hladík, Milan
2011
5 p. 893-899
artikel
61 Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm Kuno, Takahito
2018
5 p. 933-943
artikel
62 Computing the resolvent of the sum of operators with application to best approximation problems Dao, Minh N.

5 p. 1193-1205
artikel
63 Computing tighter bounds on the n-queens constant via Newton’s method Nobel, Parth

5 p. 1229-1240
artikel
64 Conditions for linear convergence of the gradient method for non-convex optimization Abbaszadehpeivasti, Hadi

5 p. 1105-1125
artikel
65 Conjugate gradient methods using value of objective function for unconstrained optimization Iiduka, Hideaki
2011
5 p. 941-955
artikel
66 Constraint relaxation, cost-sensitive learning and bagging for imbalanced classification problems with outliers Razzaghi, Talayeh
2015
5 p. 915-928
artikel
67 Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse Chen, Zhiping
2013
5 p. 1647-1662
artikel
68 Convergence analysis for the modified spectral projected subgradient method Loreto, Milagros
2014
5 p. 915-929
artikel
69 Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems Hoseini Monjezi, N.

5 p. 1495-1511
artikel
70 Convergence theorem of common fixed points for a family of nonspreading mappings in Hilbert space Kangtunyakarn, Atid
2011
5 p. 957-961
artikel
71 Convex hull representations of special monomials of binary variables DeVries, Audrey
2019
5 p. 977-992
artikel
72 Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function Hiriart-Urruty, Jean-Baptiste
2011
5 p. 841-849
artikel
73 Convex risk minimization via proximal splitting methods Boţ, Radu Ioan
2014
5 p. 867-885
artikel
74 Cooperation of customers in traveling salesman problems with profits Osicka, Ondrej

5 p. 1219-1233
artikel
75 Correction to: Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application Ahmadi-Javid, Amir

5 p. 1287
artikel
76 Correction to: Two‑machine flow shop scheduling with convex resource consumption functions Choi, Byung-Cheon

5 p. 1261-1262
artikel
77 Cruise itineraries optimal scheduling Di Pillo, Gianni

5 p. 1665-1689
artikel
78 DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs Lu, Cheng
2017
5 p. 985-996
artikel
79 Degree sequence optimization in bounded treewidth Onn, Shmuel

5 p. 1127-1132
artikel
80 3D-Hit: fast structural comparison of proteins on multicore architectures Bieniasz-Krzywiec, Ł.
2013
5 p. 1783-1794
artikel
81 Direct k-routing versus cross-docking: worst-case results Bertazzi, Luca

5 p. 1579-1586
artikel
82 Disciplined geometric programming Agrawal, Akshay
2019
5 p. 961-976
artikel
83 Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem Dell’Amico, Mauro

5 p. 1617-1648
artikel
84 Equality measures properties for location problems Barbati, Maria
2015
5 p. 903-920
artikel
85 Erratum to: On convex optimization without convex representation Lasserre, Jean B.
2014
5 p. 1795-1796
artikel
86 Error bounds for polynomial optimization over the hypercube using putinar type representations Magron, Victor
2014
5 p. 887-895
artikel
87 Error bounds for strongly monotone and Lipschitz continuous variational inequalities Pham, Khanh Duy
2017
5 p. 971-984
artikel
88 Existence and generic stability conditions of equilibrium points to controlled systems for n-player multiobjective generalized games using the Kakutani–Fan–Glicksberg fixed-point theorem Hung, Nguyen Van

5 p. 1477-1493
artikel
89 Experiments on virtual private network design with concave capacity costs Lodi, Andrea
2018
5 p. 945-957
artikel
90 Gap functions and error bounds for generalized vector variational inequalities Sun, Xiang-Kai
2013
5 p. 1663-1673
artikel
91 Generalized Nash equilibrium and dynamics of popularity of online contents Fargetta, Georgia

5 p. 1691-1709
artikel
92 Generalized vector mixed general quasi-variational-like inequalities in Hausdorff topological vector spaces Ding, Xie Ping
2012
5 p. 893-902
artikel
93 Hyperbolicity cones of elementary symmetric polynomials are spectrahedral Brändén, Petter
2013
5 p. 1773-1782
artikel
94 Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs Li, Wenjie
2013
5 p. 1691-1706
artikel
95 Inventory replenishment decisions model for the supplier selection problem facing low perfect rate situations Alejo-Reyes, Avelina

5 p. 1509-1535
artikel
96 Inverse max+sum spanning tree problem under weighted $$l_1$$l1 norm by modifying the sum-cost vector Guan, Xiucui
2017
5 p. 1065-1077
artikel
97 Letter to the Editor Janiak, Adam
2012
5 p. 1045
artikel
98 Linear formulations and valid inequalities for a classic location problem with congestion: a robust optimization application Ahmadi-Javid, Amir

5 p. 1265-1285
artikel
99 Linear transformation based solution methods for non-convex mixed integer quadratic programs Newby, Eric
2015
5 p. 967-981
artikel
100 Local minimizers versus X-local minimizers Khan, Akhtar A.
2012
5 p. 1027-1033
artikel
101 Locating facilities in a competitive environment Karakitsiou, A.
2015
5 p. 929-945
artikel
102 Location-based techniques for the synergy approximation in combinatorial transportation auctions Triki, Chefi
2015
5 p. 1125-1139
artikel
103 Matching orderable and separable hypergraphs Onn, Shmuel

5 p. 1393-1401
artikel
104 Maximizing Barber’s bipartite modularity is also hard Miyauchi, Atsushi
2014
5 p. 897-913
artikel
105 Metric subregularity and/or calmness of the normal cone mapping to the p-order conic constraint system Sun, Ying
2018
5 p. 1095-1110
artikel
106 Mixed equilibrium problems with Z*-bifunctions and least element problems in Banach lattices Hu, Rong
2012
5 p. 933-947
artikel
107 Modeling the spread of infectious diseases through influence maximization Yao, Shunyu

5 p. 1563-1586
artikel
108 Modelling the mobile target covering problem using flying drones Di Puglia Pugliese, Luigi
2015
5 p. 1021-1052
artikel
109 Modelling transfer line design problem via a set partitioning problem Borisovsky, Pavel
2011
5 p. 915-926
artikel
110 Models, algorithms and applications for location problems Bruno, Giuseppe
2016
5 p. 871-873
artikel
111 Moderately exponential time algorithms for the maximum induced matching problem Chang, Maw-Shang
2014
5 p. 981-998
artikel
112 Multi-criteria logistics modeling for military humanitarian assistance and disaster relief aerial delivery operations Bastian, Nathaniel D.
2015
5 p. 921-953
artikel
113 Multiobjective programming with new invexities Stefanescu, Maria Viorica
2012
5 p. 855-870
artikel
114 Multitime hybrid differential games with multiple integral functional Udrişte, Constantin

5 p. 1821-1834
artikel
115 Necessary and sufficient condition on global optimality without convexity and second order differentiability Burai, Pál
2012
5 p. 903-911
artikel
116 New method for determining search directions for interior-point algorithms in linear optimization Darvay, Zsolt
2017
5 p. 1099-1116
artikel
117 New single machine scheduling with nonnegative inventory constraints and discretely controllable processing times Zhou, Binghai
2019
5 p. 1111-1142
artikel
118 Nonsmooth sparsity constrained optimization problems: optimality conditions Movahedian, N.
2018
5 p. 1027-1038
artikel
119 On a Bregman regularized proximal point method for solving equilibrium problems Neto, J. X. Cruz
2019
5 p. 1143-1155
artikel
120 On an iterative method for solving absolute value equations Noor, Muhammad Aslam
2011
5 p. 1027-1033
artikel
121 On Constraint qualifications of a nonconvex inequality Wei, Zhou
2017
5 p. 1117-1139
artikel
122 On evolution of an information dynamic system and its generating operator Belavkin, Roman V.
2011
5 p. 827-840
artikel
123 On generalized $$\epsilon $$ϵ-subdifferential and radial epiderivative of set-valued mappings Guo, X. L.
2013
5 p. 1707-1720
artikel
124 On gradient projection methods for strongly pseudomonotone variational inequalities without Lipschitz continuity Hai, Trinh Ngoc

5 p. 1177-1191
artikel
125 On Lagrangian duality in vector optimization: applications to the linear case Pagani, Elisa
2011
5 p. 901-914
artikel
126 Online total bipartite matching problem Shanks, Meghan

5 p. 1411-1426
artikel
127 On matrix exponentials and their approximations related to optimization on the Stiefel manifold Zhu, Xiaojing
2018
5 p. 1069-1083
artikel
128 On necessary and sufficient conditions for near-optimal singular stochastic controls Hafayed, Mokhtar
2012
5 p. 949-966
artikel
129 On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel–Penot subdifferentials Laha, Vivek
2013
5 p. 1675-1690
artikel
130 On Rump’s characterization of P-matrices Rohn, Jiri
2011
5 p. 1017-1020
artikel
131 On solving convex optimization problems with linear ascending constraints Wang, Zizhuo
2014
5 p. 819-838
artikel
132 On swarm-level resource allocation in BitTorrent communities Vinkó, Tamás
2012
5 p. 923-932
artikel
133 On the linear convergence of the stochastic gradient method with constant step-size Cevher, Volkan
2018
5 p. 1177-1187
artikel
134 On the solution existence and stability of polynomial optimization problems Hieu, Vu Trung

5 p. 1513-1529
artikel
135 On the solution existence and stability of quadratically constrained nonconvex quadratic programs Tam, Nguyen Nang
2017
5 p. 1045-1063
artikel
136 On the trade-off between number of examples and precision of supervision in machine learning problems Gnecco, Giorgio

5 p. 1711-1733
artikel
137 On two questions of optimization theory concerning quadratic mappings Arutyunov, A. V.
2011
5 p. 1009-1015
artikel
138 Optimality conditions for homogeneous polynomial optimization on the unit sphere Huang, Lei

5 p. 1263-1270
artikel
139 Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints Martínez-Legaz, Juan Enrique
2014
5 p. 1017-1023
artikel
140 Optimality conditions in convex optimization with locally Lipschitz constraints Hong, Zhe
2018
5 p. 1059-1068
artikel
141 Optimal override policy for chemotherapy scheduling template via mixed-integer linear programming Huang, Yu-Li

5 p. 1549-1562
artikel
142 Optimal road maintenance investment in traffic networks with random demands Passacantando, Mauro

5 p. 1799-1819
artikel
143 Optimization by ant algorithms: possible roles for an individual ant Zufferey, Nicolas
2011
5 p. 963-973
artikel
144 Optimization of sensor battery charging to maximize lifetime in a wireless sensors network Carrabs, Francesco

5 p. 1587-1600
artikel
145 Ordered median problem with demand distribution weights Ogryczak, Włodzimierz
2015
5 p. 1071-1086
artikel
146 Parameterized computational complexity of finding small-diameter subgraphs Schäfer, Alexander
2011
5 p. 883-891
artikel
147 Path planning for unmanned vehicles with localization constraints Sundar, Kaarthik
2019
5 p. 993-1009
artikel
148 Preface Daniele, Patrizia

5 p. 1507-1508
artikel
149 Preface to the special issue dedicated to the 2015 World Congress on Global Optimization Pardalos, Panos M.
2017
5 p. 893
artikel
150 Quadrature-based polynomial optimization Martinez, Angeles

5 p. 1027-1036
artikel
151 Quantitative stability of fully random two-stage stochastic programs with mixed-integer recourse Chen, Zhiping

5 p. 1249-1264
artikel
152 Quasi ϵ-solutions in a semi-infinite programming problem with locally Lipschitz data Jiao, Liguo

5 p. 1759-1772
artikel
153 Real options approach to explore the effect of organizational change on IoT development project Zhou, Zhiping
2016
5 p. 995-1011
artikel
154 Regularized quasi-monotone method for stochastic optimization Kungurtsev, V.

5 p. 1215-1228
artikel
155 Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization Zhang, Hui
2014
5 p. 961-979
artikel
156 Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data Sun, Xiangkai

5 p. 1457-1476
artikel
157 Selfish bin packing under Harmonic mean cost sharing mechanism Gai, Ling

5 p. 1445-1456
artikel
158 Separable standard quadratic optimization problems Bomze, Immanuel M.
2011
5 p. 857-866
artikel
159 Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search Tang, Jingyong
2013
5 p. 1753-1771
artikel
160 Solving a home energy management problem by Simulated Annealing Bastianetto, Edoardo

5 p. 1553-1564
artikel
161 Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming Harrach, Bastian

5 p. 1599-1609
artikel
162 Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$O(nm+n2d/4) algorithm for $$d$$d-degenerate graphs Buchanan, Austin
2013
5 p. 1611-1617
artikel
163 Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B Hrga, Timotej

5 p. 1201-1213
artikel
164 Sparse and risk diversification portfolio selection Li, Qian

5 p. 1181-1200
artikel
165 Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines Wang, Ximing
2016
5 p. 1013-1024
artikel
166 Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint Jiang, Yanjun

5 p. 1235-1248
artikel
167 Structure learning of Bayesian Networks using global optimization with applications in data classification Taheri, Sona
2014
5 p. 931-948
artikel
168 The assignment problem revisited Alfaro, Carlos A.

5 p. 1531-1548
artikel
169 The calculus of simplex gradients Regis, Rommel G.
2014
5 p. 845-865
artikel
170 The clique problem for graphs with a few eigenvalues of the same sign Malyshev, D. S.
2014
5 p. 839-843
artikel
171 The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities Schmidt, Martin

5 p. 1355-1372
artikel
172 The existence of zeros of set-valued mappings in reflexive Banach spaces Zhong, Ren-you
2013
5 p. 1741-1751
artikel
173 The forward–backward splitting method and its convergence rate for the minimization of the sum of two functions in Banach spaces Guan, Wei-Bo

5 p. 1735-1758
artikel
174 The multi-stage dynamic stochastic decision process with unknown distribution of the random utilities Tadei, Roberto

5 p. 1207-1218
artikel
175 The Nelder–Mead simplex algorithm with perturbed centroid for high-dimensional function optimization Fajfar, Iztok
2018
5 p. 1011-1025
artikel
176 The perspective of a bank in granting credits: an optimization model Cerqueti, Roy
2011
5 p. 867-882
artikel
177 The probabilistic and reliable connected power dominating set problems Sun, Ou
2018
5 p. 1189-1206
artikel
178 The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions Mordukhovich, Boris
2012
5 p. 839-853
artikel
179 Tower-of-sets analysis for the Kise–Ibaraki–Mine algorithm Li, Maoqin
2012
5 p. 1017-1026
artikel
180 Two-machine flow shop scheduling with convex resource consumption functions Choi, Byung-Cheon

5 p. 1241-1259
artikel
181 Two-stage robust mixed integer programming problem with objective uncertainty Zhang, Ning
2017
5 p. 959-969
artikel
182 Using neural networks to solve linear bilevel problems with unknown lower level Molan, Ioana

5 p. 1083-1103
artikel
183 Variational iteration technique for solving a system of nonlinear equations Noor, Muhammad Aslam
2012
5 p. 991-1007
artikel
184 Weighted robust optimality of convex optimization problems with data uncertainty Huang, La

5 p. 1089-1105
artikel
                             184 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland