Robert Weismantel - Concepedia

Author

Robert Weismantel

Otto-von-Guericke University Magdeburg

Also Known As

R. Weismantel, Robert Weismantel, Rothvoss, Thomas, Weismantel, R., Weismantel, Robert

242

Publications

4.3K

Citations

H-Index

126

Concepts

All Affiliations

Otto-von-Guericke University Magdeburg ETH Zurich Zuse Institute Berlin Max Planck Institute for Dynamics of Complex Technical Systems Technion – Israel Institute of Technology

About

Robert Weismantel is an author at Otto-von-Guericke University Magdeburg specializing in engineering, mathematical programming, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	28	65	2.6K
2	Medicine	7	7	540
3	Education	6	6	254
4	Natural Sciences	4	4	336
5	Social Sciences	1	1	19

Robert Weismantel

Publications

3.1K

Citations

H-Index

Page 1

	Year	Citations
A Logical Model Provides Insights into T Cell Receptor Signaling Julio Sáez-Rodríguez, Luca Simeoni, Jonathan A. Lindquist, PLoS Computational Biology EngineeringT-regulatory CellImmunologyComplex Signaling NetworkRegulatory T Cells	2007	349
Cutting planes in integer and mixed integer programming Hugues Marchand, Alexander Martín, Robert Weismantel, Discrete Applied Mathematics Cutting Plane MethodsGeometric ModelingMathematical ProgrammingEngineeringInteger Optimization	2002	241
The node capacitated graph partitioning problem: A computational study Carlos Eduardo Ferreira, Alexander Martín, Cid C. de Souza, Mathematical Programming Cluster ComputingNetwork ScienceGraph TheoryGraph Partitioning ProblemEngineering	1998	110
A Semidefinite Programming Approach to the Quadratic Knapsack Problem Christoph Helmberg, Franz Rendl, Robert Weismantel Journal of Combinatorial Optimization	2000	99
On the 0/1 knapsack polytope Robert Weismantel Mathematical Programming Mathematical ProgrammingEngineeringCombinatorial ProblemDiscrete OptimizationKnapsack Polytope	1997	91
Formulations and valid inequalities for the node capacitated graph partitioning problem Carlos Eduardo Ferreira, Alexander Martín, Cid C. de Souza, Mathematical Programming Mathematical ProgrammingCluster ComputingEngineeringGraph TheoryGraph Partitioning Problem	1996	88
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>N</mml:mi></mml:math>-fold integer programming Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Discrete Optimization Mathematical ProgrammingMath XmlnsEngineeringInteger OptimizationOptimization	2007	85
The steiner tree packing problem in VLSI design Martin Grötschel, Alexander Martín, Robert Weismantel Mathematical Programming EngineeringGraph TheoryVlsi DesignCombinatorial DesignComputer Engineering	1997	79
Solving Multiple Knapsack Problems by Cutting Planes Carlos Eduardo Ferreira, Alexander Martín, Robert Weismantel SIAM Journal on Optimization Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringComputational ComplexityDiscrete Optimization	1996	74
Packing Steiner trees: a cutting plane algorithm and computational results Martin Grötschel, Alexander Martín, Robert Weismantel Mathematical Programming Mathematical ProgrammingEngineeringGraph TheoryNetwork AlgorithmGeometric Algorithm	1996	74

Page 1