Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Geir Dahl" ( http://dblp.L3S.de/Authors/Geir_Dahl )

URL (Homepage):  http://heim.ifi.uio.no/~geird/index_eng.html  Author page on DBLP  Author page in RDF  Community of Geir Dahl in ASPL-2

Publication years (Num. hits)
1993-2004 (17) 2005-2010 (11)
Publication types (Num. hits)
article(27) inproceedings(1)
Venues (Conferences, Journals, ...)
Oper. Res. Lett.(7) Networks(4) Discrete Applied Mathematics(3) Electronic Notes in Discrete M...(2) Annals OR(1) Applied Mathematics and Comput...(1) Computers & OR(1) Discrete Mathematics(1) European Journal of Operationa...(1) IEEE Transactions on Image Pro...(1) INFORMS Journal on Computing(1) IPCO(1) Math. Program.(1) Mathematical and Computer Mode...(1) Operations Research(1) Telecommunication Systems(1)
Authors
Geir Dahl(28) Truls Flatberg(4) Njål Foldnes(3) Geir Storvik(2) Harald Minken(2) Luis Gouveia(2) Ali Ridha Mahjoub(1) Alice Fadnes(1) Bjarne Johannessen(1) Bjørnar Realfsen(1) David Huygens(1) François Margot(1) Mechthild Stoer(1) Michael O. Ball(1) Pierre Pesneau(1) Richard A. Brualdi(1) More (+10 of total 17)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords
Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Geir Dahl, Harald Minken A note on permutations and rank aggregation. Search on Bibsonomy Mathematical and Computer Modelling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael O. Ball, Geir Dahl, Thomas Vossen Matchings in connection with ground delay program planning. Search on Bibsonomy Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Geir Dahl Disjoint congruence classes and a timetabling application. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Harald Minken Methods based on discrete optimization for finding road network rehabilitation strategies. Search on Bibsonomy Computers & OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Geir Dahl Majorization and distances in trees. Search on Bibsonomy Networks The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Geir Dahl A note on a parameter relating traffic equilibria and system optimal routing. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Geir Dahl, David Huygens, Ali Ridha Mahjoub, Pierre Pesneau On the k edge-disjoint 2-hop-constrained paths polytope. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Njål Foldnes LP based heuristics for the multiple knapsack problem with assignment restrictions. Search on Bibsonomy Annals OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Randomized rounding, Traffic routing, Multiple knapsack problem
1Geir Dahl, Richard A. Brualdi Matrices of zeros and ones with given line sums and a zero block. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Truls Flatberg A remark concerning graphical sequences. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Truls Flatberg Optimization and reconstruction of hv-convex (0, 1)-matrices. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Njål Foldnes, Luis Gouveia A note on hop-constrained walk polytopes. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Luis Gouveia On the directed hop-constrained shortest path problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Bjarne Johannessen The 2-path network problem. Search on Bibsonomy Networks The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Truls Flatberg Some constrained partitioning problems and majorization. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Njål Foldnes Complete description of a class of knapsack polytopes. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Truls Flatberg Optimization and reconstruction of hv-convex (0, 1)-matrices. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Geir Storvik, Alice Fadnes Large-Scale Integer Programs in Image Analysis. Search on Bibsonomy Operations Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Bjørnar Realfsen The cardinality-constrained shortest path problem in 2-graphs. Search on Bibsonomy Networks The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Geir Storvik, Geir Dahl Lagrangian-based methods for finding MAP solutions for MRF models. Search on Bibsonomy IEEE Transactions on Image Processing The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Geir Dahl Notes on polyhedra associated with hop-constrained paths. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Geir Dahl The 2-hop spanning tree problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Geir Dahl Polytopes related to the linfinity-distance between vectors. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Geir Dahl, François Margot Weak k-majorization and polyhedra. Search on Bibsonomy Math. Program. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Geir Dahl, Mechthild Stoer A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. Search on Bibsonomy INFORMS Journal on Computing The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Geir Dahl Polyhedra and Optimization in Connection with a Weak Majorization Ordering. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF polyhedral combinatorics, Majorization
1Geir Dahl The design of survivable directed networks. Search on Bibsonomy Telecommunication Systems The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Geir Dahl Directed Steiner Problems with Connectivity Constraints. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #28 of 28 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.