Weismantel R.

R. Weismantel

Information about the author R. Weismantel will soon be added to the site.
Found 15 papers in total
A primal all-integer algorithm based on irreducible solutions
A primal all-integer algorithm based on irreducible solutions
2003
This paper introduces an exact primal augmentation algorithm for solving general...
Integral decomposition of polyhedra and some applications in mixed integer programming
Integral decomposition of polyhedra and some applications in mixed integer programming
2003
This paper addresses the question of decomposing an infinite family of rational...
Hilbert bases and the facets of special knapsack polytopes
Hilbert bases and the facets of special knapsack polytopes
1996
We present a linear description of the 0/1 knapsack polytope for the special case when...
Exponential irreducible neighborhoods for combinatorial optimisation problems
Exponential irreducible neighborhoods for combinatorial optimisation problems
2002
This paper deals with irreducible augmentation vectors associated with three...
The integral basis method for integer programming
The integral basis method for integer programming
2001
This paper introduces an exact algorithm for solving integer programs, neither using...
Set packing relaxations of some integer programs
Set packing relaxations of some integer programs
2000
This paper is about set packing relaxations of combinatorial optimization problems...
The node capacitated graph partitioning problem: A computational study
The node capacitated graph partitioning problem: A computational study
1998
In this paper we consider the problem of k -partitioning the nodes of a graph with...
Test sets of integer programs
Test sets of integer programs
1998
This article is a survey about recent developments in the area of test sets of...
The Steiner tree packing problem in VLSI design
The Steiner tree packing problem in VLSI design
1997
In this paper we describe several versions of the routing problem arising in VLSI...
Formulations and valid inequalities for the node capacitated graph partitioning problem
Formulations and valid inequalities for the node capacitated graph partitioning problem
1996
We investigate the problem of partitioning the nodes of a graph under capacity...
Packing Steiner trees: Polyhedral investigations
Packing Steiner trees: Polyhedral investigations
1996
Let G=(V,E) be a graph and T⊆V be a node set. The authors call an edge set S a...
Packing Steiner trees: A cutting plane algorithnm and computational results
Packing Steiner trees: A cutting plane algorithnm and computational results
1996
In this paper the authors describe a cutting plane algorithm for the Steiner tree...
Routing in grid graphs by cutting planes
Routing in grid graphs by cutting planes
1995
In this paper the authors study the following problem, which they call the weighted...
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits
1994
The placement problem in the layout design of electronic circuits consists of finding...
Some integer programs arising in the design of main frame computers
Some integer programs arising in the design of main frame computers
1993
In this paper the authors describe and discuss a problem that arises in the (global)...
Papers per page: