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
 
                             31 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A fully stochastic primal-dual algorithm Bianchi, Pascal

15 2 p. 701-710
artikel
2 An adaptive agent-based process model for optimizing innovative design Zhang, Qiang

15 2 p. 591-612
artikel
3 An efficient bidding heuristic for simultaneous truckload transportation auctions Olcaytu, Evren

15 2 p. 459-468
artikel
4 An inertial Popov’s method for solving pseudomonotone variational inequalities Thong, Duong Viet

15 2 p. 757-777
artikel
5 A note on Banach’s results concerning homogeneous polynomials associated with nonnegative tensors Liang, Chang

15 2 p. 419-429
artikel
6 A randomized heuristic repair for the multidimensional knapsack problem Martins, Jean P.

15 2 p. 337-355
artikel
7 Communication topology optimization for three-dimensional persistent formation with leader constraint Wang, Guoqiang

15 2 p. 513-535
artikel
8 Efficient nearest neighbors methods for support vector machines in high dimensional feature spaces Montañés, Diana C.

15 2 p. 391-404
artikel
9 Evaluation of solution of discrete optimization problem with incomplete input Barketau, Maksim

15 2 p. 431-440
artikel
10 Event-based optimization approach for solving stochastic decision problems with probabilistic constraint Lu, Xiaonong

15 2 p. 569-590
artikel
11 Exact approaches for competitive facility location with discrete attractiveness Lin, Yun Hui

15 2 p. 377-389
artikel
12 Existence of optimal solutions to Lagrange problems for ordinary control systems involving fractional Laplace operators Kamocki, Rafał

15 2 p. 779-801
artikel
13 Greedy approximation for the minimum connected dominating set with labeling Yang, Zishen

15 2 p. 685-700
artikel
14 Improved DE search for competing groups scheduling with deterioration effects Liao, Baoyu

15 2 p. 469-494
artikel
15 Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation Darvay, Zsolt

15 2 p. 357-376
artikel
16 Inverse conic linear programs in Banach spaces Ghate, Archis

15 2 p. 289-310
artikel
17 Minmizing service span with batch-position-based learning effects Cheng, Bayi

15 2 p. 553-567
artikel
18 Multiple sink location problem in path networks with a combinational objective Luo, Taibo

15 2 p. 733-755
artikel
19 New projection methods for equilibrium problems over fixed point sets Anh, Pham Ngoc

15 2 p. 627-648
artikel
20 On the computational complexity of uncapacitated multi-plant lot-sizing problems Cunha, Jesus O.

15 2 p. 803-812
artikel
21 On the convergence rate of the Halpern-iteration Lieder, Felix

15 2 p. 405-418
artikel
22 On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane R2 Li, Jianping

15 2 p. 669-683
artikel
23 On the solution existence to convex polynomial programs and its applications Nguyen, Nang Tam

15 2 p. 719-731
artikel
24 Optimal pricing strategy of a hybrid trade old for new and remanufactured products supply chain Zhu, Xiaoxi

15 2 p. 495-511
artikel
25 Optimization approach to Berge equilibrium for bimatrix game Enkhbat, Rentsen

15 2 p. 711-718
artikel
26 Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines Lu, Shaojun

15 2 p. 537-551
artikel
27 Robust approach to restricted items selection problem Drwal, Maciej

15 2 p. 649-667
artikel
28 Stability analysis for set-valued equilibrium problems with applications to Browder variational inclusions Anh, L. Q.

15 2 p. 613-626
artikel
29 The rate of convergence of proximal method of multipliers for second-order cone optimization problems Chu, Li

15 2 p. 441-457
artikel
30 The vertex colourability problem for {claw,butterfly}-free graphs is polynomial-time solvable Malyshev, D. S.

15 2 p. 311-326
artikel
31 Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs Singh, Bismark

15 2 p. 327-336
artikel
                             31 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland