Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             44 results found
no title author magazine year volume issue page(s) type
1 A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights Gupta, Anjulika
2017
1 p. 29-54
article
2 A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights Gupta, Anjulika

1 p. 29-54
article
3 A modification of the $$\alpha \hbox {BB}$$αBB method for box-constrained optimization and an application to inverse kinematics Eichfelder, Gabriele
2015
1 p. 93-121
article
4 A modification of the α BB method for box-constrained optimization and an application to inverse kinematics Eichfelder, Gabriele

1 p. 93-121
article
5 An improved cut-and-solve algorithm for the single-source capacitated facility location problem Gadegaard, Sune Lauth
2017
1 p. 1-27
article
6 An improved cut-and-solve algorithm for the single-source capacitated facility location problem Gadegaard, SuneLauth

1 p. 1-27
article
7 An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions Boţ, Radu Ioan
2015
1 p. 3-25
article
8 An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions Boţ, Radu Ioan

1 p. 3-25
article
9 A polyhedral approach to the generalized minimum labeling spanning tree problem Silva, Thiago Gouveia da
2018
1 p. 47-77
article
10 A polyhedral approach to the generalized minimum labeling spanning tree problem Silva, ThiagoGouveiada

1 p. 47-77
article
11 A primal heuristic for optimizing the topology of gas networks based on dual information Humpola, Jesco
2014
1 p. 53-78
article
12 A primal heuristic for optimizing the topology of gas networks based on dual information Humpola, Jesco

1 p. 53-78
article
13 Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games Basilico, Nicola

1 p. 3-31
article
14 Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games Basilico, Nicola

1 p. 3-31
article
15 ε -Constraint method for bi-objective competitive facility location problem with uncertain demand scenario Beresnev, Vladimir

1 p. 33-59
article
16 ε-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario Beresnev, Vladimir

1 p. 33-59
article
17 Dualization and discretization of linear-quadratic control problems with bang–bang solutions Alt, Walter
2015
1 p. 47-77
article
18 Dualization and discretization of linear-quadratic control problems with bang–bang solutions Alt, Walter

1 p. 47-77
article
19 Formulations and algorithms for the recoverable Γ -robust knapsack problem Büsing, Christina

1 p. 15-45
article
20 Formulations and algorithms for the recoverable $${\varGamma }$$Γ-robust knapsack problem Büsing, Christina
2018
1 p. 15-45
article
21 Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent Jiang, W.e.i.

1 p. 85-101
article
22 Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent Jiang, Wei

1 p. 85-101
article
23 Joint location and pricing within a user-optimized environment Dan, Teodora

1 p. 61-84
article
24 Joint location and pricing within a user-optimized environment Dan, Teodora

1 p. 61-84
article
25 New exact solution approaches for the split delivery vehicle routing problem Ozbaygin, Gizem
2017
1 p. 85-115
article
26 New exact solution approaches for the split delivery vehicle routing problem Ozbaygin, Gizem

1 p. 85-115
article
27 Observation thinning in data assimilation computations Gratton, Serge
2014
1 p. 31-51
article
28 Observation thinning in data assimilation computations Gratton, Serge

1 p. 31-51
article
29 On the application of an Augmented Lagrangian algorithm to some portfolio problems Birgin, E. G.
2015
1 p. 79-92
article
30 On the application of an augmented Lagrangian algorithm to some portfolio problems Birgin, E.G.

1 p. 79-92
article
31 On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems Shefi, Ron
2015
1 p. 27-46
article
32 On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems Shefi, Ron

1 p. 27-46
article
33 Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming Papageorgiou, Dimitri J.
2017
1 p. 55-83
article
34 Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming Papageorgiou, DimitriJ.

1 p. 55-83
article
35 Real-time algorithms for the bilevel double-deck elevator dispatching problem Sorsa, Janne
2018
1 p. 79-122
article
36 Real-time algorithms for the bilevel double-deck elevator dispatching problem Sorsa, Janne

1 p. 79-122
article
37 Solving the maximum edge-weight clique problem in sparse graphs with compact formulations Gouveia, Luis
2014
1 p. 1-30
article
38 Solving the maximum edge-weight clique problem in sparse graphs with compact formulations Gouveia, Luis

1 p. 1-30
article
39 Special issue on bilevel optimization Brotcorne, Luce

1 p. 1-2
article
40 Special issue on bilevel optimization Brotcorne, Luce

1 p. 1-2
article
41 Special issue on “Non-linear continuous optimization” Burachik, Regina S.
2016
1 p. 1-2
article
42 Special issue on “Non-linear continuous optimization” Burachik, Regina S.

1 p. 1-2
article
43 Ten years of feasibility pump, and counting Berthold, Timo
2018
1 p. 1-14
article
44 Ten years of feasibility pump, and counting Berthold, Timo

1 p. 1-14
article
                             44 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands