| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-cut approach to the crossing number problem
|
Buchheim, Christoph
|
|
2008
|
5 |
2 |
p. 373-388
16 p.
|
artikel
|
| 2 |
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
|
Boros, Endre
|
|
2008
|
5 |
2 |
p. 501-529
29 p.
|
artikel
|
| 3 |
An algorithmic framework for convex mixed integer nonlinear programs
|
Bonami, Pierre
|
|
2008
|
5 |
2 |
p. 186-204
19 p.
|
artikel
|
| 4 |
An improved algorithm for computing Steiner minimal trees in Euclidean d -space
|
Fampa, Marcia
|
|
2008
|
5 |
2 |
p. 530-540
11 p.
|
artikel
|
| 5 |
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
|
Hashimoto, Hideki
|
|
2008
|
5 |
2 |
p. 434-456
23 p.
|
artikel
|
| 6 |
A pricing problem under Monge property
|
Günlük, Oktay
|
|
2008
|
5 |
2 |
p. 328-336
9 p.
|
artikel
|
| 7 |
A Special Issue in Memory of George B. Dantzig
|
Balas, Egon
|
|
2008
|
5 |
2 |
p. 145-150
6 p.
|
artikel
|
| 8 |
A unified interpretation of several combinatorial dualities
|
Bland, Robert G.
|
|
2008
|
5 |
2 |
p. 337-349
13 p.
|
artikel
|
| 9 |
Combined route capacity and route length models for unit demand vehicle routing problems
|
Godinho, Maria Teresa
|
|
2008
|
5 |
2 |
p. 350-372
23 p.
|
artikel
|
| 10 |
Computing robust basestock levels
|
Bienstock, Daniel
|
|
2008
|
5 |
2 |
p. 389-414
26 p.
|
artikel
|
| 11 |
Editorial Board
|
|
|
2008
|
5 |
2 |
p. IFC-
1 p.
|
artikel
|
| 12 |
Exploiting planarity in separation routines for the symmetric traveling salesman problem
|
Letchford, Adam N.
|
|
2008
|
5 |
2 |
p. 220-230
11 p.
|
artikel
|
| 13 |
George B. Dantzig and systems optimization
|
Gill, Philip E.
|
|
2008
|
5 |
2 |
p. 151-158
8 p.
|
artikel
|
| 14 |
George Dantzig in the development of economic analysis
|
Arrow, Kenneth J.
|
|
2008
|
5 |
2 |
p. 159-167
9 p.
|
artikel
|
| 15 |
George Dantzig’s contributions to integer programming
|
Grötschel, Martin
|
|
2008
|
5 |
2 |
p. 168-173
6 p.
|
artikel
|
| 16 |
George Dantzig’s impact on the theory of computation
|
Karp, Richard M.
|
|
2008
|
5 |
2 |
p. 174-185
12 p.
|
artikel
|
| 17 |
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
|
Sherali, Hanif D.
|
|
2008
|
5 |
2 |
p. 270-289
20 p.
|
artikel
|
| 18 |
How tight is the corner relaxation?
|
Fischetti, Matteo
|
|
2008
|
5 |
2 |
p. 262-269
8 p.
|
artikel
|
| 19 |
Intermediate integer programming representations using value disjunctions
|
Köppe, Matthias
|
|
2008
|
5 |
2 |
p. 293-313
21 p.
|
artikel
|
| 20 |
N -fold integer programming
|
De Loera, Jesús A.
|
|
2008
|
5 |
2 |
p. 231-241
11 p.
|
artikel
|
| 21 |
Nonconvex, lower semicontinuous piecewise linear optimization
|
Vielma, Juan Pablo
|
|
2008
|
5 |
2 |
p. 467-488
22 p.
|
artikel
|
| 22 |
Note on pseudolattices, lattices and submodular linear programs
|
Faigle, Ulrich
|
|
2008
|
5 |
2 |
p. 489-500
12 p.
|
artikel
|
| 23 |
On the p -median polytope of Y -free graphs
|
Baïou, Mourad
|
|
2008
|
5 |
2 |
p. 205-219
15 p.
|
artikel
|
| 24 |
ε -optimization schemes and L -bit precision: Alternative perspectives for solving combinatorial optimization problems
|
Orlin, James B.
|
|
2008
|
5 |
2 |
p. 550-561
12 p.
|
artikel
|
| 25 |
Partition inequalities for capacitated survivable network design based on directed p-cycles
|
Atamtürk, Alper
|
|
2008
|
5 |
2 |
p. 415-433
19 p.
|
artikel
|
| 26 |
Polarity and the complexity of the shooting experiment
|
Hunsaker, Brady
|
|
2008
|
5 |
2 |
p. 541-549
9 p.
|
artikel
|
| 27 |
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
|
Easton, Todd
|
|
2008
|
5 |
2 |
p. 254-261
8 p.
|
artikel
|
| 28 |
Stochastic scheduling in an in-forest
|
Rothblum, Uriel G.
|
|
2008
|
5 |
2 |
p. 457-466
10 p.
|
artikel
|
| 29 |
The Grothendieck constant of random and pseudo-random graphs
|
Alon, Noga
|
|
2008
|
5 |
2 |
p. 323-327
5 p.
|
artikel
|
| 30 |
The inverse 1-median problem on a cycle
|
Burkard, Rainer E.
|
|
2008
|
5 |
2 |
p. 242-253
12 p.
|
artikel
|
| 31 |
The k -path tree matroid and its applications to survivable network design
|
Arkin, Esther M.
|
|
2008
|
5 |
2 |
p. 314-322
9 p.
|
artikel
|
| 32 |
The travelling preacher, projection, and a lower bound for the stability number of a graph
|
Cameron, Kathie
|
|
2008
|
5 |
2 |
p. 290-292
3 p.
|
artikel
|
Tijdschrift beschrijving