Geir Dahl
Geir Dahl
Verified email at math.uio.no - Homepage
Title
Cited by
Cited by
Year
A polyhedral approach to multicommodity survivable network design
M Stoer, G Dahl
Numerische Mathematik 68 (1), 149-167, 1994
1751994
A cutting plane algorithm for multicommodity survivable network design problems
G Dahl, M Stoer
INFORMS Journal on Computing 10 (1), 1-11, 1998
1711998
Properties of the beampattern of weight-and layout-optimized sparse arrays
S Holm, B Elgetun, G Dahl
IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control 44 …, 1997
1531997
On formulations and methods for the hop-constrained minimum spanning tree problem
G Dahl, L Gouveia, C Requejo
Handbook of optimization in telecommunications, 493-515, 2006
872006
Matrix majorization
G Dahl
Linear Algebra and Its Applications 288, 53-73, 1999
841999
A tensor product matrix approximation problem in quantum physics
G Dahl, JM Leinaas, J Myrheim, E Ovrum
Linear algebra and its applications 420 (2-3), 711-725, 2007
782007
Routing through virtual paths in layered telecommunication networks
G Dahl, A Martin, M Stoer
Operations Research 47 (5), 693-702, 1999
671999
On the directed hop-constrained shortest path problem
G Dahl, L Gouveia
Operations Research Letters 32 (1), 15-22, 2004
622004
The 2-hop spanning tree problem
G Dahl
Operations Research Letters 23 (1-2), 21-26, 1998
541998
Permutation matrices related to Sudoku
G Dahl
Linear Algebra and its Applications 430 (8-9), 2457-2463, 2009
442009
The 2‐path network problem
G Dahl, B Johannessen
Networks: An International Journal 43 (3), 190-199, 2004
442004
Notes on polyhedra associated with hop-constrained paths
G Dahl
Operations research letters 25 (2), 97-100, 1999
401999
On the k edge-disjoint 2-hop-constrained paths polytope
G Dahl, D Huygens, AR Mahjoub, P Pesneau
Operations research letters 34 (5), 577-582, 2006
312006
Tridiagonal doubly stochastic matrices
G Dahl
Linear algebra and its applications 390, 197-208, 2004
302004
Lagrangian-based methods for finding MAP solutions for MRF models
G Storvik, G Dahl
IEEE Transactions on Image Processing 9 (3), 469-479, 2000
302000
A note on hop-constrained walk polytopes
G Dahl, NL Foldnes, L Gouveia
Operations Research Letters 32 (4), 345-349, 2004
292004
Stable set polytopes for a class of circulant graphs
G Dahl
SIAM Journal on Optimization 9 (2), 493-503, 1999
291999
An introduction to convexity
G Dahl
Retrieved from University of Oslo: http://heim. ifi. uio. no/geird/conv. pdf, 2010
262010
Optimization and reconstruction of hv-convex (0, 1)-matrices
G Dahl, T Flatberg
Discrete applied mathematics 151 (1-3), 93-105, 2005
242005
An introduction to convexity, polyhedral theory and combinatorial optimization
G Dahl
University of Oslo, Department of Informatics, 1997
241997
The system can't perform the operation now. Try again later.
Articles 1–20