| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A completely positive representation of 0–1 linear programs with joint probabilistic constraints
|
Cheng, Jianqiang
|
|
2013
|
41 |
6 |
p. 597-601
5 p.
|
artikel
|
| 2 |
A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue
|
Sarhangian, Vahid
|
|
2013
|
41 |
6 |
p. 659-663
5 p.
|
artikel
|
| 3 |
A hybrid genetic algorithm for the repetition free longest common subsequence problem
|
Castelli, Mauro
|
|
2013
|
41 |
6 |
p. 644-649
6 p.
|
artikel
|
| 4 |
A minmax regret median problem on a tree under uncertain locations of the demand points
|
Conde, Eduardo
|
|
2013
|
41 |
6 |
p. 602-606
5 p.
|
artikel
|
| 5 |
Analysis of Smith’s rule in stochastic machine scheduling
|
Jagtenberg, Caroline
|
|
2013
|
41 |
6 |
p. 570-575
6 p.
|
artikel
|
| 6 |
Analyzing social media data having discontinuous underlying dynamics
|
Servi, L.D.
|
|
2013
|
41 |
6 |
p. 581-585
5 p.
|
artikel
|
| 7 |
An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds
|
Tang, Guo-ji
|
|
2013
|
41 |
6 |
p. 586-591
6 p.
|
artikel
|
| 8 |
An LP-based 3 2 -approximation algorithm for the s – t path graph Traveling Salesman Problem
|
Gao, Zhihan
|
|
2013
|
41 |
6 |
p. 615-617
3 p.
|
artikel
|
| 9 |
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
|
Averbakh, Igor
|
|
2013
|
41 |
6 |
p. 710-714
5 p.
|
artikel
|
| 10 |
A procedure to compute the nucleolus of the assignment game
|
Martínez-de-Albéniz, F. Javier
|
|
2013
|
41 |
6 |
p. 675-678
4 p.
|
artikel
|
| 11 |
A scenario decomposition algorithm for 0–1 stochastic programs
|
Ahmed, Shabbir
|
|
2013
|
41 |
6 |
p. 565-569
5 p.
|
artikel
|
| 12 |
Asymptotics of the area under the graph of a Lévy-driven workload process
|
Blanchet, J.
|
|
2013
|
41 |
6 |
p. 730-736
7 p.
|
artikel
|
| 13 |
Binary group facets with complete support and non-binary coefficients
|
Shu, Yan
|
|
2013
|
41 |
6 |
p. 679-684
6 p.
|
artikel
|
| 14 |
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
|
Kasperski, Adam
|
|
2013
|
41 |
6 |
p. 639-643
5 p.
|
artikel
|
| 15 |
Complete description for the spanning tree problem with one linearised quadratic term
|
Fischer, Anja
|
|
2013
|
41 |
6 |
p. 701-705
5 p.
|
artikel
|
| 16 |
Critical edges for the assignment problem: Complexity and exact resolution
|
Bazgan, Cristina
|
|
2013
|
41 |
6 |
p. 685-689
5 p.
|
artikel
|
| 17 |
Determining the fill rate for a periodic review inventory policy with capacitated replenishments, lost sales and zero lead time
|
Dubois, Thomas
|
|
2013
|
41 |
6 |
p. 726-729
4 p.
|
artikel
|
| 18 |
Disjoint cycles with different length in 4-arc-dominated digraphs
|
Gao, Yunshu
|
|
2013
|
41 |
6 |
p. 650-653
4 p.
|
artikel
|
| 19 |
Economic lot sizing: The capacity reservation model
|
Lee, Chung-Yee
|
|
2013
|
41 |
6 |
p. 670-674
5 p.
|
artikel
|
| 20 |
Editorial Board
|
|
|
2013
|
41 |
6 |
p. IFC-
1 p.
|
artikel
|
| 21 |
Envy-free two-player m -cake and three-player two-cake divisions
|
Lebert, Nicolas
|
|
2013
|
41 |
6 |
p. 607-610
4 p.
|
artikel
|
| 22 |
Feedback saddle point solution of counterterror measures and economic growth game
|
Wang, Jun
|
|
2013
|
41 |
6 |
p. 706-709
4 p.
|
artikel
|
| 23 |
Incremental and encoding formulations for Mixed Integer Programming
|
Yıldız, Sercan
|
|
2013
|
41 |
6 |
p. 654-658
5 p.
|
artikel
|
| 24 |
Kőnig’s edge-colouring theorem for all graphs
|
Cornaz, D.
|
|
2013
|
41 |
6 |
p. 592-596
5 p.
|
artikel
|
| 25 |
Locally ideal formulations for piecewise linear functions with indicator variables
|
Sridhar, Srikrishna
|
|
2013
|
41 |
6 |
p. 627-632
6 p.
|
artikel
|
| 26 |
Measuring the impact of primal heuristics
|
Berthold, Timo
|
|
2013
|
41 |
6 |
p. 611-614
4 p.
|
artikel
|
| 27 |
Non-linear equity portfolio variance reduction under a mean–variance framework—A delta–gamma approach
|
Jewell, Sean W.
|
|
2013
|
41 |
6 |
p. 694-700
7 p.
|
artikel
|
| 28 |
On allocation of redundancies in two-component series systems
|
Zhao, Peng
|
|
2013
|
41 |
6 |
p. 690-693
4 p.
|
artikel
|
| 29 |
On Pareto optimality conditions in the case of two-dimension non-convex utility space
|
Golubin, A.Y.
|
|
2013
|
41 |
6 |
p. 636-638
3 p.
|
artikel
|
| 30 |
On the information-based complexity of stochastic programming
|
Tavares, Gabriela
|
|
2013
|
41 |
6 |
p. 622-626
5 p.
|
artikel
|
| 31 |
Optimality of ( s , S ) -policies in a dynamic pricing model with replenishment opportunities: A sample path approach
|
Li, Jian
|
|
2013
|
41 |
6 |
p. 719-725
7 p.
|
artikel
|
| 32 |
Routing by ranking: A link analysis method for the constrained dial-a-ride problem
|
Häme, Lauri
|
|
2013
|
41 |
6 |
p. 664-669
6 p.
|
artikel
|
| 33 |
Routing vehicles to minimize fuel consumption
|
Gaur, Daya Ram
|
|
2013
|
41 |
6 |
p. 576-580
5 p.
|
artikel
|
| 34 |
The discrete moment problem with fractional moments
|
Ninh, Anh
|
|
2013
|
41 |
6 |
p. 715-718
4 p.
|
artikel
|
| 35 |
The “least flexible job first” rule in scheduling and in queueing
|
Pinedo, Michael
|
|
2013
|
41 |
6 |
p. 618-621
4 p.
|
artikel
|
| 36 |
Uniqueness in quadratic and hyperbolic 0–1 programming problems
|
Deineko, Vladimir G.
|
|
2013
|
41 |
6 |
p. 633-635
3 p.
|
artikel
|
Tijdschrift beschrijving