Dahl Geir

Geir Dahl

Information about the author Geir Dahl will soon be added to the site.
Found 16 papers in total
Reconstructing (0,1)-matrices from projections using integer programming
Reconstructing (0,1)-matrices from projections using integer programming
2009
We study the problem of reconstructing (0,1)–matrices based on projections along...
LP based heuristics for the multiple knapsack problem with assignment restrictions
LP based heuristics for the multiple knapsack problem with assignment restrictions
2006
Starting with a problem in wireless telecommunication, we are led to study the...
On the k edge-disjoint 2-hop-constrained paths polytope
On the k edge-disjoint 2-hop-constrained paths polytope
2006
The k edge-disjoint 1-hop-constrained paths problem consists in finding a minimum cost...
Some constrained partitioning problems and majorization
Some constrained partitioning problems and majorization
2004
We consider some constrained partitioning problems for a finite set of objects of...
A note on hop-constrained walk polytopes
A note on hop-constrained walk polytopes
2004
A hop-constrained walk is a walk with at most H arcs. The cases H ⩽3 have been...
The 2-path network problem
The 2-path network problem
2004
Given a graph with nonnegative edge weights and a set D of node pairs, the 2-path...
On the directed hop-constrained shortest path problem
On the directed hop-constrained shortest path problem
2004
In this paper we discuss valid inequalities for the directed hop-constrained shortest...
Complete description of a class of knapsack polytopes
Complete description of a class of knapsack polytopes
2003
We study the knapsack polytopes that arise whenever the item weights are of two types:...
Large-scale integer programs in image analysis
Large-scale integer programs in image analysis
2002
An important problem in image analysis is to segment an image into regions with...
The cardinality-constrained shortest path problem in 2-graphs
The cardinality-constrained shortest path problem in 2-graphs
2000
We study the cardinality-constrained shortest path problem in acyclic graphs and, in...
Notes on polyhedra associated with hop-constrained paths
Notes on polyhedra associated with hop-constrained paths
1999
We study the dominant of the convex hull of st -paths with at most k edges in a graph....
The 2-hop spanning tree problem
The 2-hop spanning tree problem
1998
A spanning tree in a graph G where each node has distance at most 2 from a root node r...
Routing through virtual paths in layered telecommunication networks
Routing through virtual paths in layered telecommunication networks
1999
We study a network configuration problem in telecommunications where one wants to set...
Weak k-majorization and polyhedra
Weak k-majorization and polyhedra
1998
For integers k and n with k ⩽ n a vector x ∈ ℝ n is said to be weakly k...
A cutting plane algorithm for multicommodity survivable network design problems
A cutting plane algorithm for multicommodity survivable network design problems
1998
We present a cutting plane algorithm for solving the following telecommunications...
Directed Steiner problems with connectivity constraints
Directed Steiner problems with connectivity constraints
1993
The paper presents a generalization of the Steiner problem in a directed graph. Given...
Papers per page: