Geir Dahl

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 11

Top Topics

Singular Value Decomposition

Physico Chemical

Top Venues

Discret. Appl. Math.

Adv. Appl. Math.

SIAM J. Matrix Anal. Appl.

Publications

Richard A. Brualdi, Geir Dahl
Multipermutations and Stirling Multipermutations. Graphs Comb. 40 (1) (2024)
Richard A. Brualdi, Geir Dahl
Frobenius-König theorem for classes of (0,±1)-matrices. Discret. Math. 347 (6) (2024)
Richard A. Brualdi, Geir Dahl
Permutation graphs and the weak Bruhat order. Art Discret. Appl. Math. 6 (3) (2022)
Richard A. Brualdi, Geir Dahl
Convex (0, 1)-matrices and their epitopes. Discret. Appl. Math. 297 (2021)
Richard A. Brualdi, Geir Dahl
Alternating Sign Matrices: Extensions, König-Properties, and Primary Sum-Sequences. Graphs Comb. 36 (1) (2020)
Richard A. Brualdi, Geir Dahl
The interval structure of (0, 1)-matrices. Discret. Appl. Math. 266 (2019)
Richard A. Brualdi, Geir Dahl
Alternating sign matrices and hypermatrices, and a generalization of Latin squares. Adv. Appl. Math. 95 (2018)
Agostinho Agra, Geir Dahl, Torkel Andreas Haufmann, Sofia J. Pinheiro
The k-regular induced subgraph problem. Discret. Appl. Math. 222 (2017)
Richard A. Brualdi, Geir Dahl
Alternating sign matrices, extensions and related cones. Adv. Appl. Math. 86 (2017)
Maria Charina, Geir Dahl
Subdivision schemes, network flows and linear optimization. Adv. Comput. Math. 41 (3) (2015)
Richard A. Brualdi, Geir Dahl
Strict Sign-Central Matrices. SIAM J. Matrix Anal. Appl. 36 (3) (2015)
Richard A. Brualdi, Geir Dahl
Majorization for partially ordered sets. Discret. Math. 313 (22) (2013)
Geir Dahl, Fuzhen Zhang
Integral majorization Polytopes. Discret. Math. Algorithms Appl. 5 (3) (2013)
Fred E. Benth, Geir Dahl, Carlo Mannino
Computing Optimal Recovery Policies for Financial Markets. Oper. Res. 60 (6) (2012)
Geir Dahl, Harald Minken
A note on permutations and rank aggregation. Math. Comput. Model. 52 (1-2) (2010)
Michael O. Ball, Geir Dahl, Thomas Vossen
Matchings in connection with ground delay program planning. Networks 53 (3) (2009)
Geir Dahl, Truls Flatberg
Reconstructing (0, 1)-matrices from projections using integer programming. Comput. Optim. Appl. 42 (1) (2009)
Geir Dahl
Disjoint congruence classes and a timetabling application. Discret. Appl. Math. 157 (8) (2009)
Geir Dahl, Harald Minken
Methods based on discrete optimization for finding road network rehabilitation strategies. Comput. Oper. Res. 35 (7) (2008)
Geir Dahl
A note on a parameter relating traffic equilibria and system optimal routing. Appl. Math. Comput. 191 (2) (2007)
Geir Dahl
Majorization and distances in trees. Networks 50 (4) (2007)
Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau
edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34 (5) (2006)
Geir Dahl, Njål Foldnes
LP based heuristics for the multiple knapsack problem with assignment restrictions. Ann. Oper. Res. 146 (1) (2006)
Geir Dahl, Richard A. Brualdi
Matrices of zeros and ones with given line sums and a zero block. Electron. Notes Discret. Math. 20 (2005)
Geir Dahl, Truls Flatberg
A remark concerning graphical sequences. Discret. Math. 304 (1-3) (2005)
Geir Dahl, Truls Flatberg
-convex (0, 1)-matrices. Discret. Appl. Math. 151 (1-3) (2005)
Geir Dahl, Bjarne Johannessen
The 2-path network problem. Networks 43 (3) (2004)
Geir Dahl, Njål Foldnes, Luis Eduardo Neves Gouveia
A note on hop-constrained walk polytopes. Oper. Res. Lett. 32 (4) (2004)
Geir Dahl, Truls Flatberg
Some constrained partitioning problems and majorization. Eur. J. Oper. Res. 158 (2) (2004)
Geir Dahl, Luis Eduardo Neves Gouveia
On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32 (1) (2004)
Geir Dahl, Truls Flatberg
Optimization and reconstruction of hv-convex (0, 1)-matrices. Electron. Notes Discret. Math. 12 (2003)
Geir Dahl, Njål Foldnes
Complete description of a class of knapsack polytopes. Oper. Res. Lett. 31 (3) (2003)
Geir Dahl, Geir Storvik, Alice Fadnes
Large-Scale Integer Programs in Image Analysis. Oper. Res. 50 (3) (2002)
Geir Dahl, Bjørnar Realfsen
The cardinality-constrained shortest path problem in 2-graphs. Networks 36 (1) (2000)
Geir Storvik, Geir Dahl
Lagrangian-based methods for finding MAP solutions for MRF models. IEEE Trans. Image Process. 9 (3) (2000)
Geir Dahl
Stable Set Polytopes for a Class of Circulant Graphs. SIAM J. Optim. 9 (2) (1999)
Geir Dahl, Alexander Martin, Mechthild Stoer
Routing Through Virtual Paths in Layered Telecommunication Networks. Oper. Res. 47 (5) (1999)
Geir Dahl
Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25 (2) (1999)
Geir Dahl, Mechthild Stoer
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. INFORMS J. Comput. 10 (1) (1998)
Geir Dahl
-distance between vectors. Oper. Res. Lett. 22 (1) (1998)
Geir Dahl
The 2-hop spanning tree problem. Oper. Res. Lett. 23 (1-2) (1998)
Geir Dahl, François Margot
Weak k-majorization and polyhedra. Math. Program. 81 (1998)
Geir Dahl
Polyhedra and Optimization in Connection with a Weak Majorization Ordering. IPCO (1995)
Geir Dahl, Kurt Jörnsten, G. Løvnes, S. Svaet
Graph optimization problems in connection with the management of mobile communications systems. Telecommun. Syst. 3 (3) (1994)
Geir Dahl
The design of survivable directed networks. Telecommun. Syst. 2 (1) (1993)
Geir Dahl
Directed Steiner Problems with Connectivity Constraints. Discret. Appl. Math. 47 (2) (1993)