nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
|
Flores-Bazán, Fabián |
|
2013 |
145 |
1-2 |
p. 263-290 |
artikel |
2 |
A new graph parameter related to bounded rank positive semidefinite matrix completions
|
Laurent, Monique |
|
2013 |
145 |
1-2 |
p. 291-325 |
artikel |
3 |
Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
|
Frangioni, Antonio |
|
2013 |
145 |
1-2 |
p. 133-161 |
artikel |
4 |
Convex hull representation of the deterministic bipartite network interdiction problem
|
Sullivan, Kelly M. |
|
2013 |
145 |
1-2 |
p. 349-376 |
artikel |
5 |
Design and verify: a new scheme for generating cutting-planes
|
Dey, Santanu S. |
|
2013 |
145 |
1-2 |
p. 199-222 |
artikel |
6 |
Dijkstra’s algorithm and L-concave function maximization
|
Murota, Kazuo |
|
2013 |
145 |
1-2 |
p. 163-177 |
artikel |
7 |
Efficient formulations for pricing under attraction demand models
|
Keller, Philipp W. |
|
2013 |
145 |
1-2 |
p. 223-261 |
artikel |
8 |
Erratum to: Risk-averse dynamic programming for Markov decision processes
|
Ruszczyński, Andrzej |
|
2014 |
145 |
1-2 |
p. 601-604 |
artikel |
9 |
Graver basis and proximity techniques for block-structured separable convex integer minimization problems
|
Hemmecke, Raymond |
|
2013 |
145 |
1-2 |
p. 1-18 |
artikel |
10 |
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
|
Dash, Sanjeeb |
|
2013 |
145 |
1-2 |
p. 483-508 |
artikel |
11 |
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets
|
Chung, Kwanghun |
|
2013 |
145 |
1-2 |
p. 403-450 |
artikel |
12 |
Monotonic stable solutions for minimum coloring games
|
Hamers, H. |
|
2013 |
145 |
1-2 |
p. 509-529 |
artikel |
13 |
On the Chvátal–Gomory closure of a compact convex set
|
Dadush, Daniel |
|
2013 |
145 |
1-2 |
p. 327-348 |
artikel |
14 |
Optimality conditions for maximizing a function over a polyhedron
|
Hager, William W. |
|
2013 |
145 |
1-2 |
p. 179-198 |
artikel |
15 |
Passivity and complementarity
|
Camlibel, M. K. |
|
2013 |
145 |
1-2 |
p. 531-563 |
artikel |
16 |
Performance of first-order methods for smooth convex minimization: a novel approach
|
Drori, Yoel |
|
2013 |
145 |
1-2 |
p. 451-482 |
artikel |
17 |
Preemptive and non-preemptive generalized min sum set cover
|
Im, Sungjin |
|
2013 |
145 |
1-2 |
p. 377-401 |
artikel |
18 |
Semi-continuous network flow problems
|
Angulo, Gustavo |
|
2013 |
145 |
1-2 |
p. 565-599 |
artikel |
19 |
Strong Abadie CQ, ACQ, calmness and linear regularity
|
Wei, Zhou |
|
2013 |
145 |
1-2 |
p. 97-131 |
artikel |
20 |
The triangle closure is a polyhedron
|
Basu, Amitabh |
|
2013 |
145 |
1-2 |
p. 19-58 |
artikel |
21 |
VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
|
Facchinei, Francisco |
|
2013 |
145 |
1-2 |
p. 59-96 |
artikel |