Geir Dahl

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