Reinelt Gerhard

Gerhard Reinelt

Information about the author Gerhard Reinelt will soon be added to the site.
Found 13 papers in total
On‐line bin packing with restricted repacking
On‐line bin packing with restricted repacking
2014
Semi‐on‐line algorithms for the bin‐packing problem allow, in...
Improving access to health facilities in Nouna district, Burkina Faso
Improving access to health facilities in Nouna district, Burkina Faso
2012
The Nouna health district in Burkina Faso, has a population of approximately 275,000...
Minimizing the maximum travel time in a combined model of facility location and network design
Minimizing the maximum travel time in a combined model of facility location and network design
2012
This paper presents a combined Facility Location/Network Design Problem which...
Exact solution of the 2‐dimensional grid arrangement problem
Exact solution of the 2‐dimensional grid arrangement problem
2012
Given an undirected graph G = ( V , E ) , we consider injective mappings of its...
A benchmark library and a comparison of heuristic methods for the linear ordering problem
A benchmark library and a comparison of heuristic methods for the linear ordering problem
2012
The linear ordering problem consists of finding an acyclic tournament in a complete...
A Branch and Cut solver for the maximum stable set problem
A Branch and Cut solver for the maximum stable set problem
2011
This paper deals with the cutting‐plane approach to the maximum stable set...
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation
A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation
2011
China plans to launch four small optical satellites and four small SAR satellites to...
Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs
Improved analysis of an algorithm for the coupled task problem with UET (unit execution time) jobs
2009
The coupled task problem is to schedule n jobs, each one consisting of two subtasks...
Maximally violated mod-p cuts for the capacitated vehicle-routing problem
Maximally violated mod-p cuts for the capacitated vehicle-routing problem
2006
This paper makes a contribution to the branch and cut approach to the capacitated...
A tabu search algorithm for the min–max k-Chinese postman problem
A tabu search algorithm for the min–max k-Chinese postman problem
2006
In this paper we present a tabu search algorithm for the min–max k -Chinese...
BoxStep methods for crew pairing problems
BoxStep methods for crew pairing problems
2006
Crew pairing problems are often solved using column generation in a branch-and-price...
The weighted consecutive ones problem for a fixed number of rows or columns
The weighted consecutive ones problem for a fixed number of rows or columns
2003
The NP-hard weighted consecutive ones problem consists of converting a given...
A complete description of the traveling salesman polytope on 8 nodes
A complete description of the traveling salesman polytope on 8 nodes
1991
The authors present three previously unknown classes of facets for the symmetric...
Papers per page: